Crossing-number critical graphs have bounded path-width
From MaRDI portal
Publication:1400969
DOI10.1016/S0095-8956(03)00037-6zbMath1021.05028WikidataQ29011978 ScholiaQ29011978MaRDI QIDQ1400969
Publication date: 17 August 2003
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Related Items (17)
Embedding grids in surfaces ⋮ Characterizing 2-crossing-critical graphs ⋮ Stars and Bonds in Crossing-Critical Graphs ⋮ Properties of Large 2-Crossing-Critical Graphs ⋮ Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c \le 12\) ⋮ Domination and independence number of large 2-crossing-critical graphs ⋮ 2-Layer Graph Drawings with Bounded Pathwidth ⋮ ON THE ADDITIVITY OF CROSSING NUMBERS OF GRAPHS ⋮ On degree properties of crossing-critical families of graphs ⋮ Crossing number for graphs with bounded pathwidth ⋮ Crossing-critical graphs with large maximum degree ⋮ Unnamed Item ⋮ Structure and generation of crossing-critical graphs ⋮ Stars and bonds in crossing-critical graphs ⋮ Nested cycles in large triangulations and crossing-critical graphs ⋮ Unnamed Item ⋮ On the crossing numbers of loop networks and generalized Petersen graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Large non-planar graphs and an application to crossing-critical graphs
- A framework for solving VLSI graph layout problems
- Minimal graphs with crossing number at least \(k\)
- Graph minors. I. Excluding a forest
- Construction of crossing-critical graphs
- Quickly excluding a forest
- Graphs drawn with few crossings per edge
- Intersections of curve systems and the crossing number of \(C_ 5\times C_ 5\)
- Embedding grids in surfaces
- Crossing Number is NP-Complete
- Crossing-Free Subgraphs
- Toward a theory of crossing numbers
This page was built for publication: Crossing-number critical graphs have bounded path-width
