Planarizing graphs---a survey and annotated bibliography.
Liebers, Annegret (2001)
Journal of Graph Algorithms and Applications
Similarity:
Displaying similar documents to “Crossing numbers and cutwidths.”
Planarizing graphs---a survey and annotated bibliography.
The coarseness of a graph
Lowell W. Beineke, Gary Chartrand (1968)
Compositio Mathematica
Similarity:
Distinct distances in graph drawings.
Carmi, Paz, Dujmovic, Vida, Morin, Pat, Wood, David R. (2008)
The Electronic Journal of Combinatorics [electronic only]
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...
Bar -visibility graphs.
Dean, Alice M., Evans, William, Gethner, Ellen, Laison, Joshua D., Safari, Mohammad Ali, Trotter, William T. (2007)
Journal of Graph Algorithms and Applications
Similarity:
Characterization of magic graphs
Samuel Jezný, Marián Trenkler (1983)
Czechoslovak Mathematical Journal
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: