Excluding clocks

DOI10.1016/J.ENDM.2015.07.018MaRDI QIDQ324738zbMATH OpenOpenAlexFDO

Authors Pierre Aboulker, Zhentao Li, Stéphan Thomassé

Publication date 17 October 2016

Full work available at URL https://doi.org/10.1016/j.endm.2015.07.018

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38)

Recommendations

• Cycles through specified vertices in triangle-free graphs
• Excluding cycles with a fixed number of chords
• Cycles in triangle-free graphs of large chromatic number
• Relative length of longest paths and longest cycles in triangle-free graphs
• A structure theorem for graphs with no cycle with a unique chord and its consequences

Cites work

• A class of three-colorable triangle-free graphs
• Graph theory
• Graphs that do not contain a cycle with a node that has at least two neighbors on it

Cited in

(1)

• Induced subgraphs and tree decompositions. XIV: Non-adjacent neighbours in a hole

This page was built for publication: Excluding clocks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324738)