4 papers
Seymour-tight orientations
Krystal Guo, Ross J. Kang, Gabriëlle Zwaneveld
We investigate `almost counterexamples' to Seymour's second neighbourhood conjecture. In what we call Seymour-tight orientations, the size of the first neighbourhood of each vertex…
Vu's conjecture holds for claw-free graphs
Linda Cook, Ross J. Kang, Eileen Robinson +1
Given a graph , let denote the maximum number of neighbors any two distinct vertices of have in common. Vu (2002) proposed that, provided is not too small…
Spectral approaches for -improper chromatic number
Krystal Guo, Ross J. Kang, Gabriëlle Zwaneveld
In this paper, we explore algebraic approaches to -improper and -clustered colourings, where the colouring constraints are relaxed to allow some monochromatic edges. Bilu [J.…
Recognizing trees from incomplete decks
Gabriëlle Zwaneveld
For a given graph, the unlabeled subgraphs are called the cards of and the deck of is the multiset . Wendy Myrvold [Ars Combinatoria, 1989] showe…