The Decycling Number of Cubic Planar Graphs

DOI10.1007/978-3-540-70666-3_16MaRDI QIDQ3595437zbMATH OpenOpenAlexFDO

Authors N. Punnim

Publication date 28 August 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70666-3_16

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38)

Recommendations

• Combinatorial Geometry and Graph Theory
• Decycling number and graph embeddings
• Decycling number and upper-embeddibility of generalized Petersen graphs
• The decycling number and maximum genus of cubic graphs
• A note on decycling number and vertex-arboricity of cubic graphs

Cited in

(10)

• New formulae for the decycling number of graphs
• scientific article; zbMATH DE number 1463399 (Why is no real title available?)
• The decycling number and maximum genus of cubic graphs
• Cycle intersection graphs and minimum decycling sets of even graphs
• A new formula for the decycling number of regular graphs
• The decycling number of a line graph
• Decycling number and upper-embeddibility of generalized Petersen graphs
• The Planar Slope Number of Subcubic Graphs
• scientific article; zbMATH DE number 6303054 (Why is no real title available?)
• Combinatorial Geometry and Graph Theory

This page was built for publication: The Decycling Number of Cubic Planar Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595437)