Mathew C. Francis

activity

20062022

most citedVPG and EPG bend-numbers of Halin Graphs

21 citations · 34 across the 21 of their papers we have counts for

collaborators

Showing 2020Show all

3 papers · 1 filter

cs.DS2020

Recognizing $k$ -Clique Extendible Orderings

Mathew Francis, Rian Neogi, Venkatesh Raman

A graph is $k$ -clique-extendible if there is an ordering of the vertices such that whenever two $k$ -sized overlapping cliques $A$ and $B$ have $k - 1$ common vertices, and these comm…

math.CO2020★ 1 cited

The linear arboricity conjecture for graphs of low degeneracy

Manu Basavaraju, Arijit Bishnu, Mathew Francis +1

A linear forest is an acyclic graph whose each connected component is a path; or in other words, it is an acyclic graph whose maximum degree is at most 2. A linear coloring of a gr…

cs.DM2020

Representing graphs as the intersection of cographs and threshold graphs

Daphna Chacko, Mathew C. Francis

A graph $G$ is said to be the intersection of graphs $G_{1}, G_{2}, \dots, G_{k}$ if $V (G) = V (G_{1}) = V (G_{2}) = \dots = V (G_{k})$ and $E (G) = E (G_{1}) \cap E (G_{2}) \cap \dots \cap E (G_{k})$ . For a graph $G$ ,…

Recognizing k-Clique Extendible Orderings

The linear arboricity conjecture for graphs of low degeneracy

Representing graphs as the intersection of cographs and threshold graphs

Recognizing $k$ -Clique Extendible Orderings