1 citations · 1 across the 3 of their papers we have counts for
4 papers · 1 filter
Graphs of Linear Growth have Bounded Treewidth
Rutger Campbell, Marc Distel, J. Pascal Gollin +5
A graph class has linear growth if, for each graph and every positive integer , every subgraph of with radius at most contains v…
Intersecting longest paths in chordal graphs
Daniel J. Harvey, Michael S. Payne
We consider the size of the smallest set of vertices required to intersect every longest path in a chordal graph. Such sets are known as longest path transversals. We show that if…
Chromatic roots at 2 and at the Beraha number
Daniel J. Harvey, Gordon F. Royle
By the construction of suitable graphs and the determination of their chromatic polynomials, we resolve two open questions concerning real chromatic roots. First we exhibit graphs…
Cycles of given size in a dense graph
Daniel J. Harvey, David R. Wood
We generalise a result of Corrádi and Hajnal and show that every graph with average degree at least contains vertex disjoint cycles, each of order at least …