Characterizing all graphs with 2-exceptional edges

DOI10.26493/1855-3974.1282.378MaRDI QIDQ4629555zbMATH OpenOpenAlexWikidataFDO

Authors Drago Bokal, J. Leaños

Publication date 27 March 2019

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL https://doi.org/10.26493/1855-3974.1282.378

zbMATH Keywords

crossing numberexceptional edgesKuratowski subgraphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Crossing-critical edges and Kuratowski subgraphs of a graph
• Characterizing 2-crossing-critical graphs
• scientific article; zbMATH DE number 25798
• Characterizing graphs with crossing number at least 2
• Properties of large 2-crossing-critical graphs

Cites work

• An ILP-based Proof System for the Crossing Number Problem
• Characterizing 2-crossing-critical graphs
• Construction of crossing-critical graphs
• Crossing numbers of sequences of graphs II: Planar tiles
• Crossing-critical edges and Kuratowski subgraphs of a graph
• Edges and Kuratowski Subgraphs of Non-Planar Graphs
• scientific article; zbMATH DE number 25798 (Why is no real title available?)
• scientific article; zbMATH DE number 2108147 (Why is no real title available?)
• scientific article; zbMATH DE number 3087498 (Why is no real title available?)
• Infinite families of crossing-critical graphs with prescribed average degree and crossing number
• Minimal graphs with crossing number at least \(k\)
• On Degree Properties of Crossing-Critical Families of Graphs
• On the crossing numbers of Cartesian products with paths

Cited in

(5)

• scientific article; zbMATH DE number 25798 (Why is no real title available?)
• Characterization of graphs with hall number 2
• [[:Publication:4959262|On problems of \(\mathcal{CF}\)-connected graphs for \({K}_Template:M,n \)]]
• A systematic approach to crossing numbers of Cartesian products with paths
• A systematic approach to crossing numbers of Cartesian products with paths

This page was built for publication: Characterizing all graphs with 2-exceptional edges

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