Some 4-valent, 3-connected, planar, almost pancyclic graphs
From MaRDI portal
Publication:1237747
DOI10.1016/0012-365X(77)90073-5zbMath0357.05040MaRDI QIDQ1237747
Publication date: 1977
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (4)
Find subtrees of specified weight and cycles of specified length in linear time ⋮ Unnamed Item ⋮ On the vertex-arboricity of planar graphs ⋮ Some sufficient conditions for a planar graph of maximum degree six to be Class 1
Cites Work
This page was built for publication: Some 4-valent, 3-connected, planar, almost pancyclic graphs