The Planar Slope Number of Subcubic Graphs

DOI10.1007/978-3-642-54423-1_12MaRDI QIDQ5405034zbMATH OpenOpenAlexWikidataFDO

Authors Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani

Publication date 31 March 2014

Published in LATIN 2014: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-54423-1_12

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07)

Recommendations

• On the complexity of the planar slope number problem
• The Decycling Number of Cubic Planar Graphs
• The planar slope number of planar partial 3-trees of bounded degree
• The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree
• scientific article; zbMATH DE number 4016941
• scientific article; zbMATH DE number 3902677
• Subgraphs with restricted degrees of their vertices in planar graphs
• Cyclomatic numbers of planar graphs
• Planar and plane slope number of partial 2-trees
• The \(k\)-subconnectedness of planar graphs

Cited in

(7)

• Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
• An annotated review on graph drawing and its applications
• Drawing subcubic planar graphs with four slopes and optimal angular resolution
• The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree
• 1-bend upward planar slope number of SP-digraphs
• 1-bend upward planar drawings of SP-digraphs
• On the complexity of the planar slope number problem

This page was built for publication: The Planar Slope Number of Subcubic Graphs

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