3 citations · 3 across the 5 of their papers we have counts for
3 papers · 1 filter
Connected -partition of -connected graphs and -claw-free graphs
Ralf Borndörfer, Katrin Casel, Davis Issac +3
A connected partition is a partition of the vertices of a graph into sets that induce connected subgraphs. Such partitions naturally occur in many application areas such as road ne…
Upper Bounding Rainbow Connection Number by Forest Number
L. Sunil Chandran, Davis Issac, Juho Lauri +1
A path in an edge-colored graph is rainbow if no two edges of it are colored the same, and the graph is rainbow-connected if there is a rainbow path between each pair of its vertic…
Hadwiger's Conjecture for squares of 2-Trees
L. Sunil Chandran, Davis Issac, Sanming Zhou
Hadwiger's conjecture asserts that any graph contains a clique minor with order no less than the chromatic number of the graph. We prove that this well-known conjecture is true for…