B-sets and planar maps
From MaRDI portal
Cited in
(19)- On the minimal reducible bound for outerplanar and planar graphs
- A structural property of trees with an application to vertex-arboricity
- Remarks on Barnette's conjecture
- On the vertex-arboricity of planar graphs
- On the vertex-arboricity of \(K_5\)-minor-free graphs of diameter 2
- Bipartite bihypergraphs: a survey and new results
- On Barnette's conjecture and the \(H^{+-}\) property
- Vertex arboricity of planar graphs without chordal 6-cycles
- Vertex arboricity of toroidal graphs with a forbidden cycle
- A note on Barnette's conjecture
- Vertex-arboricity of planar graphs without intersecting triangles
- Hamiltonian cycles in some family of cubic 3-connected plane graphs
- Planar graph colorings without short monochromatic cycles
- Color-induced subgraphs dual to Hamilton cycles of embedded cubic graphs
- Partitioning kite‐free planar graphs into two forests
- Partitioning a planar graph without chordal 5-cycles into two forests.
- A sufficient condition for cubic 3-connected plane bipartite graphs to be Hamiltonian
- Pairs of trees in tree--tree triangulations
- On Barnette's conjecture
This page was built for publication: B-sets and planar maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2539011)