Dense circuit graphs and the planar Turán number of a cycle
From MaRDI portal
Publication:6642513
DOI10.1002/JGT.23165MaRDI QIDQ6642513
Xingxing Yu, Ruilin Shi, Zach Walsh
Publication date: 24 November 2024
Published in: Journal of Graph Theory (Search for Journal in Brave)
Enumeration in graph theory (05C30) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Title not available (Why is that?)
- Some Turán type results on the hypercube
- Long cycles in 3-connected graphs
- Planar Turán numbers of cycles: a counterexample
- Extremal Theta-free planar graphs
- Simple paths on polyhedra
- Extremal \(C_{4}\)-free/\(C_{5}\)-free planar graphs
- On maximal paths and circuits of graphs
- Planar Turán Number of the 6-Cycle
- Extremal Results in Random Graphs
- On the structure of linear graphs
- Many \(T\) copies in \(H\)-free graphs
This page was built for publication: Dense circuit graphs and the planar Turán number of a cycle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6642513)
