Crossing-number critical graphs have bounded path-width

DOI10.1016/S0095-8956(03)00037-6zbMATH Open1021.05028WikidataQ29011978 ScholiaQ29011978MaRDI QIDQ1400969FDOQ1400969

Authors: Petr Hliněný 

Publication date: 17 August 2003

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 2084270
• Stars and Bonds in Crossing-Critical Graphs
• Crossing-critical graphs with large maximum degree
• Stars and bonds in crossing-critical graphs
• Crossing-critical edges and Kuratowski subgraphs of a graph

zbMATH Keywords

graph embeddingpath-widthcrossing numbercrossing-critical graph

Mathematics Subject Classification ID

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

Cites Work

• Graphs drawn with few crossings per edge
• Crossing Number is NP-Complete
• Crossing-Free Subgraphs
• Quickly excluding a forest
• Title not available (Why is that?)
• Graph minors. I. Excluding a forest
• A framework for solving VLSI graph layout problems
• Large non-planar graphs and an application to crossing-critical graphs
• Toward a theory of crossing numbers
• Embedding grids in surfaces
• Construction of crossing-critical graphs
• Minimal graphs with crossing number at least \(k\)
• Intersections of curve systems and the crossing number of \(C_ 5\times C_ 5\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (22)

• Crossing number for graphs with bounded pathwidth
• Characterizing 2-crossing-critical graphs
• On degree properties of crossing-critical families of graphs
• Embedding grids in surfaces
• Stars and bonds in crossing-critical graphs
• New upper bounds for the crossing numbers of crossing-critical graphs
• Properties of large 2-crossing-critical graphs
• ON THE ADDITIVITY OF CROSSING NUMBERS OF GRAPHS
• Nearly light cycles in embedded graphs and crossing-critical graphs
• 2-Layer Graph Drawings with Bounded Pathwidth
• Structure and generation of crossing-critical graphs
• Nested cycles in large triangulations and crossing-critical graphs
• Crossing-critical graphs with large maximum degree
• Crossing-critical edges and Kuratowski subgraphs of a graph
• Title not available (Why is that?)
• Domination and independence number of large 2-crossing-critical graphs
• Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c \le 12\)
• Title not available (Why is that?)
• Stars and Bonds in Crossing-Critical Graphs
• Improvement on the crossing number of crossing-critical graphs
• Title not available (Why is that?)
• On the crossing numbers of loop networks and generalized Petersen graphs

This page was built for publication: Crossing-number critical graphs have bounded path-width

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