Solution of problems of Kotzig and Grünbaum concerning the isolation of cycles in planar graphs
From MaRDI portal
Publication:753827
DOI10.1007/BF01139613zbMath0717.05034MaRDI QIDQ753827
Publication date: 1989
Published in: Mathematical Notes (Search for Journal in Brave)
Related Items
On Light Edges and Triangles in Planar Graphs of Minimum Degree Five, Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11, Light graphs in families of outerplanar graphs
Cites Work