Crossing numbers of sequences of graphs II: Planar tiles

DOI10.1002/jgt.10097zbMath1017.05037OpenAlexW4243779214MaRDI QIDQ4805228

Benny Pinontoan, R. Bruce Richter

Publication date: 11 May 2003

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10097

zbMATH Keywords

crossing numbercrossing-critical graphsplanar tile

Mathematics Subject Classification ID

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

Related Items (12)

Characterizing 2-crossing-critical graphs ⋮ Deciding Parity of Graph Crossing Number ⋮ Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c \le 12\) ⋮ Domination and independence number of large 2-crossing-critical graphs ⋮ Characterizing all graphs with 2-exceptional edges ⋮ On degree properties of crossing-critical families of graphs ⋮ Structure and generation of crossing-critical graphs ⋮ Infinite families of crossing-critical graphs with prescribed average degree and crossing number ⋮ Stars and bonds in crossing-critical graphs ⋮ Crossing Numbers of Periodic Graphs ⋮ Nested cycles in large triangulations and crossing-critical graphs ⋮ On the crossing numbers of loop networks and generalized Petersen graphs

Cites Work

• Infinite families of crossing-critical graphs with given average degree
• Unnamed Item

This page was built for publication: Crossing numbers of sequences of graphs II: Planar tiles