The Minimum Number of 444-Cycles in a Maximal Planar Graph with Small Number of Vertices (original) (raw)
Related papers
An improved lower bound for the planar Tur\'an number of cycles
Cornell University - arXiv, 2022
On the Number of Simple Cycles in Planar Graphs
Combinatorics, Probability and Computing, 1999
The maximum number of copies of an even cycle in a planar graph
Cornell University - arXiv, 2022
Bounds on the number of cycles of length three in a planar graph
Israel Journal of Mathematics, 1982
Planar Graphs Without Cycles of Specific Lengths
European Journal of Combinatorics, 2002
On total chromatic number of planar graphs without 4-cycles
Science in China Series A: Mathematics, 2007
A new construction for planar Tur\'an number of cycle
arXiv (Cornell University), 2023
On -choosability of planar graphs without adjacent short cycles
Discrete Applied Mathematics, 2014
Approximate min–max relations for odd cycles in planar graphs
Mathematical Programming, 2007
Extremal Theta-free planar graphs
Discrete Mathematics, 2019
Acyclic 4-choosability of planar graphs without adjacent short cycles
Discrete Mathematics, 2012
Note on 3-choosability of planar graphs with maximum degree 4
Discrete Mathematics
3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles
SIAM Journal on Discrete Mathematics, 2010
(3, 1)*-CHOOSABILITY of Planar Graphs Without Adjacent Short Cycles
Electronic Notes in Discrete Mathematics, 2013
Structural properties and edge choosability of planar graphs without 4-cycles
Discrete Mathematics, 2008
A note on acyclic number of planar graphs
Ars Mathematica Contemporanea
The planar Tur\'an number of the seven-cycle
arXiv (Cornell University), 2023
On the vertex-arboricity of planar graphs without 7-cycles
Discrete Mathematics, 2012
On acyclic 4-choosability of planar graphs without short cycles
Discrete Mathematics, 2010
Extremal HHH-free planar graphs
arXiv (Cornell University), 2018
The Maximum Number of Paths of Length Four in a Planar Graph
arXiv (Cornell University), 2020
The Maximum Number of Pentagons in a Planar Graph
2019
On the shortness exponent of 1-tough, maximal planar graphs
Discrete Mathematics, 1996
Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
Discrete Mathematics, 2010
On short cycles through prescribed vertices of a graph
Discrete Mathematics, 2004
Acyclic 5-Choosability of Planar Graphs Without Adjacent Short Cycles
2013
Acyclic 4-colorability of planar graphs without cycles of length 4 or 6
Journal of Applied and Industrial Mathematics, 2010
Planar graphs without adjacent cycles of length at most seven are 3-colorable
Discrete Mathematics, 2010
Light subgraphs in planar graphs of minimum degree 4 and edge-degree 9
Journal of Graph Theory, 2003
The Maximum Number of Paths of Length Three in a Planar Graph
2019
The class reconstruction number of maximal planar graphs
Graphs and Combinatorics, 1987
On the maximum number of edges in quasi-planar graphs
Journal of Combinatorial Theory, Series A, 2007
Arithmetic progressions of cycles in outer-planar graphs
Discrete Mathematics, 2002
Extremal planar graphs with no cycles of particular lengths
arXiv (Cornell University), 2022
The Characterization of planar, 4-connected, K_{2,5}-minor-free graphs