Excluding cycles with a fixed number of chords
From MaRDI portal
Publication:476296
DOI10.1016/j.dam.2014.08.006zbMath1303.05093arXiv1304.1718OpenAlexW2098531449MaRDI QIDQ476296
Pierre Aboulker, Nicolas Bousquet
Publication date: 28 November 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.1718
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Triangle-free intersection graphs of line segments with large chromatic number
- The strong perfect graph theorem
- Graph Theory and Probability
- Radius two trees specify χ‐bounded classes
- Radius Three Trees in Graphs with Large Chromatic Number
- Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It
- A structure theorem for graphs with no cycle with a unique chord and its consequences
This page was built for publication: Excluding cycles with a fixed number of chords