Pages that link to "Item:Q4177606"
From MaRDI portal
The following pages link to On the number of cycles of lengthk in a maximal planar graph (Q4177606):
Displayed 26 items.
- Cliques in graphs excluding a complete graph minor (Q311514) (← links)
- On k-path Hamiltonian maximal planar graphs (Q1163036) (← links)
- Bounds on the number of cycles of length three in a planar graph (Q1163566) (← links)
- Floorplanning by graph dualization: \(L\)-shaped modules (Q1310461) (← links)
- Path partitioning planar graphs of girth 4 without adjacent short cycles (Q1615735) (← links)
- Generalised outerplanar Turán numbers and maximum number of \(k\)-vertex subtrees (Q2057597) (← links)
- Structure and pancyclicity of maximal planar graphs with diameter two (Q2075455) (← links)
- Generalized outerplanar Turán number of short paths (Q2092428) (← links)
- The maximum number of 10- and 12-cycles in a planar graph (Q2099482) (← links)
- Counting cliques in 1-planar graphs (Q2111191) (← links)
- 2-spanning cyclability problems of some generalized Petersen graphs (Q2175232) (← links)
- Path partitioning planar graphs with restrictions on short cycles (Q2234425) (← links)
- Disjoint cycles in hypercubes with prescribed vertices in each cycle (Q2446892) (← links)
- The maximum number of paths of length four in a planar graph (Q2659227) (← links)
- Generalized planar Turán numbers (Q2665977) (← links)
- On the frequency of 3-connected subgraphs of planar graphs (Q3708823) (← links)
- On the number of hamiltonian cycles in a maximal planar graph (Q3855220) (← links)
- Tree densities in sparse graph classes (Q5046563) (← links)
- The number of $4$-cycles and the cyclomatic number of a finite simple graph (Q5060435) (← links)
- Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators (Q5088601) (← links)
- Subgraph densities in a surface (Q5886343) (← links)
- The maximum number of paths of length three in a planar graph (Q6057639) (← links)
- Counting paths, cycles, and blow‐ups in planar graphs (Q6057641) (← links)
- The maximum number of induced C5's in a planar graph (Q6057646) (← links)
- The minimum number of 4-cycles in a maximal planar graph with small number of vertices (Q6092104) (← links)
- Planar graphs with the maximum number of induced 6-cycles (Q6197310) (← links)