Bounds on the number of cycles of length three in a planar graph (original) (raw)
Related papers
An improved lower bound for the planar Tur\'an number of cycles
Cornell University - arXiv, 2022
Note on 3-choosability of planar graphs with maximum degree 4
Discrete Mathematics
The radius of -connected planar graphs with bounded faces
2012
Planar Graphs Without Cycles of Specific Lengths
European Journal of Combinatorics, 2002
Some structural properties of planar graphs and their applications to 3-choosability
Discrete Mathematics, 2012
(3, 1)*-CHOOSABILITY of Planar Graphs Without Adjacent Short Cycles
Electronic Notes in Discrete Mathematics, 2013
On Light Graphs in 3-Connected Plane Graphs Without Triangular or Quadrangular Faces
Graphs and Combinatorics, 2001
3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles
SIAM Journal on Discrete Mathematics, 2010
A note on acyclic number of planar graphs
Ars Mathematica Contemporanea
On the 3-colorability of planar graphs without 4-, 7- and 9-cycles
Discrete Mathematics, 2009
On -choosability of planar graphs without adjacent short cycles
Discrete Applied Mathematics, 2014
On the Number of Acute Triangles in a Straight-Line Embedding of a Maximal Planar Graph
Journal of Combinatorial Theory, Series B, 1999
The reconstruction of maximal planar graphs. I. Recognition
Journal of Combinatorial Theory, Series B, 1981
Extremal Theta-free planar graphs
Discrete Mathematics, 2019
The Minimum Number of 444-Cycles in a Maximal Planar Graph with Small Number of Vertices
2020
On the maximum number of edges in plane graph with fixed exterior face degree
arXiv: Combinatorics, 2017
On the planarity of cyclic graphs
Rocky Mountain Journal of Mathematics, 2018
On a problem of J. Zaks concerning 5-valent 3-connected planar graphs
Discrete Mathematics, 1984
On 3-simplicial vertices in planar graphs
Discussiones Mathematicae Graph Theory, 2004
Planar graphs without adjacent cycles of length at most seven are 3-colorable
Discrete Mathematics, 2010
On the Path-Width of Planar Graphs
Siam Journal on Discrete Mathematics, 2009
Subgraphs with Restricted Degrees of Their Vertices in Planar 3-Connected Graphs
Graphs and Combinatorics, 1997
A sufficient condition for planar graphs to be 3-colorable
Journal of Combinatorial Theory, 2003
Choosability of planar graphs of girth 5
2011
Arithmetic progressions of cycles in outer-planar graphs
Discrete Mathematics, 2002
A note on the acyclic 3-choosability of some planar graphs
Discrete Applied Mathematics, 2010
Planar graphs without cycles of length from 4 to 7 are 3-colorable
Journal of Combinatorial Theory, 2005
Extremal HHH-free planar graphs
arXiv (Cornell University), 2018
The Maximum Number of Paths of Length Three in a Planar Graph
2019
Erdős-Gyárfás conjecture for cubic planar graphs
The electronic journal of combinatorics
Planar Tur\'an numbers of cubic graphs and disjoint union of cycles
Cornell University - arXiv, 2022
On the Number of Simple Cycles in Planar Graphs
Combinatorics, Probability and Computing, 1999
On the Three Colorability of Planar Graphs
Complete colorings of planar graphs
Discrete Applied Mathematics, 2019