scientific article; zbMATH DE number 3902677

MaRDI QIDQ3680852zbMATH OpenFDO

Authors Noga Alon, Yair Caro

Publication date 1984

zbMATH Keywords

planar graphstriangulations

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30)

Recommendations

• On the Number of Simple Cycles in Planar Graphs
• The maximum number of paths of length four in a planar graph
• On the frequency of 3-connected subgraphs of planar graphs
• The maximum number of paths of length three in a planar graph
• scientific article; zbMATH DE number 1107718

Cited in

(18)

• The sizes of maximal planar, outerplanar, and bipartite planar subgraphs
• Generalized outerplanar Turán number of short paths
• The maximum number of 10- and 12-cycles in a planar graph
• Counting cliques in 1-planar graphs
• The maximum number of paths of length four in a planar graph
• Generalized planar Turán numbers
• Tree densities in sparse graph classes
• The Planar Slope Number of Subcubic Graphs
• Subgraph densities in a surface
• The maximum number of paths of length three in a planar graph
• Counting paths, cycles, and blow‐ups in planar graphs
• The maximum number of induced C5's in a planar graph
• Planar graphs with the maximum number of induced 6-cycles
• Bounding the number of odd paths in planar graphs via convex optimization
• The maximum number of pentagons in a planar graph
• The maximum number of short paths in a Halin graph
• The maximum number of copies of an even cycle in a planar graphs (extended abstract)
• The maximum number of odd cycles in a planar graph

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3680852)