On a theorem of Kontsevich.
Conant, James, Vogtmann, Karen (2003)
Algebraic & Geometric Topology
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A categorification for the chromatic polynomial.”
On a theorem of Kontsevich.
Morita classes in the homology of automorphism groups of free groups.
Conant, James, Vogtmann, Karen (2004)
Geometry & Topology
Similarity:
A norm for the cohomology of 2-complexes.
Turaev, Vladimir (2002)
Algebraic & Geometric Topology
Similarity:
Chromatic index of finite and infinite graphs
Juraj Bosák (1972)
Czechoslovak Mathematical Journal
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...
Kocay's lemma, Whitney's theorem, and some polynomial invariant reconstruction problems.
Thatte, Bhalchandra D. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The Acyclic Polynomial Of A Graph
Ivan Gutman (1977)
Publications de l'Institut Mathématique
Similarity:
Decompositions of graphs into 5-cycles and other small graphs.
Sousa, Teresa (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity: