On a theorem of Kontsevich.
Conant, James, Vogtmann, Karen (2003)
Algebraic & Geometric Topology
Similarity:
Conant, James, Vogtmann, Karen (2003)
Algebraic & Geometric Topology
Similarity:
Conant, James, Vogtmann, Karen (2004)
Geometry & Topology
Similarity:
Turaev, Vladimir (2002)
Algebraic & Geometric Topology
Similarity:
Juraj Bosák (1972)
Czechoslovak Mathematical Journal
Similarity:
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...
Thatte, Bhalchandra D. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ivan Gutman (1977)
Publications de l'Institut Mathématique
Similarity:
Sousa, Teresa (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity: