The maximum number of pentagons in a planar graph
From MaRDI portal
(Redirected from Publication:6657591)
Recommendations
Cites work
- Bounding the number of odd paths in planar graphs via convex optimization
- Cliques in graphs excluding a complete graph minor
- Connectivity, graph minors, and subgraph multiplicity
- Counting paths, cycles, and blow‐ups in planar graphs
- Generalized planar Turán numbers
- scientific article; zbMATH DE number 3902677 (Why is no real title available?)
- scientific article; zbMATH DE number 3188526 (Why is no real title available?)
- scientific article; zbMATH DE number 3050594 (Why is no real title available?)
- Many \(T\) copies in \(H\)-free graphs
- Number of cliques in graphs with a forbidden subdivision
- On the frequency of 3-connected subgraphs of planar graphs
- On the maximum number of cliques in a graph
- On the maximum number of five-cycles in a triangle-free graph
- On the number of cliques in graphs with a forbidden minor
- On the number of cycles of length 4 in a maximal planar graph
- On the number of cycles of lengthk in a maximal planar graph
- On the number of pentagons in triangle-free graphs
- Subgraph densities in a surface
- Sur le problème des courbes gauches en topologie.
- The maximum number of 10- and 12-cycles in a planar graph
- The maximum number of copies of an even cycle in a planar graph
- The maximum number of paths of length three in a planar graph
- Tree densities in sparse graph classes
- Über eine Eigenschaft der ebenen Komplexe
Cited in
(4)
This page was built for publication: The maximum number of pentagons in a planar graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6657591)