Displaying similar documents to “Geometric thickness of complete graphs.”

Bar k -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:

Track layouts of graphs.

Dujmović, Vida, Pór, Attila, Wood, David R. (2004)

Discrete Mathematics and Theoretical Computer Science. DMTCS [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...