Track layouts of graphs.
Dujmović, Vida, Pór, Attila, Wood, David R. (2004)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Displaying similar documents to “Drawing a graph in a hypercube.”
Track layouts of graphs.
Three-dimensional 1-bend graph drawings.
Morin, Pat, Wood, David R. (2004)
Journal of Graph Algorithms and Applications
Similarity:
Edge-distance between isomorphism classes of graphs
Bohdan Zelinka (1987)
Časopis pro pěstování matematiky
Similarity:
Edit distance and its computation.
Balogh, József, Martin, Ryan (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The coarseness of a graph
Lowell W. Beineke, Gary Chartrand (1968)
Compositio Mathematica
Similarity:
Decompositions of graphs into 5-cycles and other small graphs.
Sousa, Teresa (2005)
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...
Crossing numbers and cutwidths.
Djidjev, Hristo N., Vrt'o, Imrich (2003)
Journal of Graph Algorithms and Applications
Similarity:
Distinct distances in graph drawings.
Carmi, Paz, Dujmovic, Vida, Morin, Pat, Wood, David R. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Saturation numbers of books.
Chen, Guantao, Faudree, Ralph J., Gould, Ronald J. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity: