Counting paths, cycles, and blow‐ups in planar graphs

DOI10.1002/jgt.22838zbMath1522.05199arXiv2101.05911OpenAlexW3122201561MaRDI QIDQ6057641

No author found.

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.05911

zbMATH Keywords

planar graphsweighted graphsextremal graph theory

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Signed and weighted graphs (05C22)

Related Items (2)

Planar graphs with the maximum number of induced 6-cycles ⋮ The maximum number of 10- and 12-cycles in a planar graph

Cites Work

• Unnamed Item
• The maximum number of paths of length four in a planar graph
• On the number of cycles of lengthk in a maximal planar graph
• Foundations of Optimization
• Subgraph densities in a surface

This page was built for publication: Counting paths, cycles, and blow‐ups in planar graphs