Planar decompositions and the crossing number of graphs with an excluded minor.

Wood, David R.; Telle, Jan Arne

Displaying similar documents to “Planar decompositions and the crossing number of graphs with an excluded minor.”

The minor crossing number of graphs with an excluded minor.

Bokal, Drago, Fijavz, Gasper, Wood, David R. (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Planarizing graphs---a survey and annotated bibliography.

Liebers, Annegret (2001)

Journal of Graph Algorithms and Applications

Similarity:

Straight-line drawings on restricted integer grids in two and three dimensions.

Felsner, Stefan, Liotta, Giuseppe, Wismath, Stephen (2003)

Journal of Graph Algorithms and Applications

Similarity:

Crossing numbers and cutwidths.

Djidjev, Hristo N., Vrt'o, Imrich (2003)

Journal of Graph Algorithms and Applications

Similarity:

Confluent drawings: visualizing non-planar diagrams in a planar way.

Dickerson, Matthew, Eppstein, David, Goodrich, Michael T., Meng, Jeremy Y. (2005)

Journal of Graph Algorithms and Applications

Similarity:

The structure of plane graphs with independent crossings and its applications to coloring problems

Xin Zhang, Guizhen Liu (2013)

Open Mathematics

Similarity:

If a graph G has a drawing in the plane in such a way that every two crossings are independent, then we call G a plane graph with independent crossings or IC-planar graph for short. In this paper, the structure of IC-planar graphs with minimum degree at least two or three is studied. By applying their structural results, we prove that the edge chromatic number of G is Δ if Δ ≥ 8, the list edge (resp. list total) chromatic number of G is Δ (resp. Δ + 1) if Δ ≥ 14 and the linear arboricity...