scientific article; zbMATH DE number 2084270

MaRDI QIDQ3043709zbMATH OpenFDO

Authors Petr Hliněný

Publication date 6 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2265/22650102.htm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Crossing-number critical graphs have bounded path-width
• Stars and bonds in crossing-critical graphs
• Structure and generation of crossing-critical graphs
• Crossing-critical graphs with large maximum degree
• Crossing number for graphs with bounded pathwidth

Cited in

(12)

• Construction of crossing-critical graphs
• Crossing-number critical graphs have bounded path-width
• On degree properties of crossing-critical families of graphs
• Making a graph crossing-critical by multiplying its edges
• Crossing number for graphs with bounded pathwidth
• Stars and bonds in crossing-critical graphs
• Properties of large 2-crossing-critical graphs
• Structure and generation of crossing-critical graphs
• scientific article; zbMATH DE number 7278018 (Why is no real title available?)
• Stars and Bonds in Crossing-Critical Graphs
• On 13-crossing-critical graphs with arbitrarily large degrees
• Crossing-critical graphs with large maximum degree

This page was built for publication:

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