The minor crossing number of graphs with an excluded minor

MaRDI QIDQ1010709zbMATH OpenFDO

Authors Drago Bokal, Gašper Fijavž, David R. Wood

Publication date 7 April 2009

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0609707, https://eudml.org/doc/117207, http://www.emis.de/journals/EJC/Volume_15/Abstracts/v15i1r4.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

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

Abstract: The "minor crossing number" of a graph $G$ is the minimum crossing number of a graph that contains $G$ as a minor. It is proved that for every graph $H$ there is a constant $c$, such that every graph $G$ with no $H$-minor has minor crossing number at most $c|V(G)|$.

Recommendations

• Graph minors and the crossing number of graphs
• Planar decompositions and the crossing number of graphs with an excluded minor
• Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
• General lower bounds for the minor crossing number of graphs
• Bounding the crossing number of a graph in terms of the crossing number of a minor with small maximum degree
• Minimal graphs with crossing number at least \(k\)
• scientific article; zbMATH DE number 1342090
• Hypergraph and minor crossing number problems
• A characterization of some graph classes using excluded minors

Cited in

(13)

• The Minor Crossing Number
• On a crossing number result of Richter and Thomassen
• Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
• Minimum degree and graph minors
• Four problems on graphs with excluded minors
• Minor-monotone crossing number
• Approximating the Crossing Number of Toroidal Graphs
• General lower bounds for the minor crossing number of graphs
• A circle criterion for a generalized cross graph in terms of minimal excluded minors
• The crossing number of a projective graph is quadratic in the face–width
• An Excluded Minor Characterization of Seymour Graphs
• Bounding the crossing number of a graph in terms of the crossing number of a minor with small maximum degree
• Graph minors and the crossing number of graphs

This page was built for publication: The minor crossing number of graphs with an excluded minor

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