DOIAbstract
AbstractThe total colouring conjecture is shown to be correct for those graphs G having Δ(G)⩾built34¦V(G)¦
AbstractThe total colouring conjecture is shown to be correct for those graphs G having Δ(G)⩾built34¦V(G)¦
AbstractThe total chromatic number χT(G) of a graph G is the minimum number of colours needed to col...
A total coloring of a graph G is a combination of vertex and edge colorings of G. In other words, is...
AbstractThe total chromatic number χt(G) of a graph G is the least number of colors needed to color ...
published source acknowledged. The original publication is available http://www.springerlink.com/co...
published source acknowledged. The original publication is available http://www.springerlink.com/co...
A total coloring of a graph G is an assignment of colors to the elements of the graph G such that no...
A total coloring of a graph G is an assignment of colors to the elements of the graph G such that no...
AbstractIt is proved that ifGis a planar graph with total (vertex–edge) chromatic number χ″, maximum...
AbstractWe give a new upper bound on the total chromatic number of a graph. This bound improves the ...
AbstractReed conjectured that for every ϵ>0 and Δ there exists g such that the fractional total chro...
Reed conjectured that for every > 0 and ∆ there exists g such that the fractional total chromatic...
Reed conjectured that for every ϵ>0 and Δ there exists g such that the fractional total chromatic nu...
If G is a simple graph with minimum degree (G) satisfying (G) f(|V(G|+1) the total chromatic number ...
AbstractThe total chromatic number χT(G) of a graph G is the least number of colours needed to colou...
Let G be a graph and let s be the maximum number of vertices of the same degree, each at least (∆(G)...
AbstractThe total chromatic number χT(G) of a graph G is the minimum number of colours needed to col...
A total coloring of a graph G is a combination of vertex and edge colorings of G. In other words, is...
AbstractThe total chromatic number χt(G) of a graph G is the least number of colors needed to color ...
published source acknowledged. The original publication is available http://www.springerlink.com/co...
published source acknowledged. The original publication is available http://www.springerlink.com/co...
A total coloring of a graph G is an assignment of colors to the elements of the graph G such that no...
A total coloring of a graph G is an assignment of colors to the elements of the graph G such that no...
AbstractIt is proved that ifGis a planar graph with total (vertex–edge) chromatic number χ″, maximum...
AbstractWe give a new upper bound on the total chromatic number of a graph. This bound improves the ...
AbstractReed conjectured that for every ϵ>0 and Δ there exists g such that the fractional total chro...
Reed conjectured that for every > 0 and ∆ there exists g such that the fractional total chromatic...
Reed conjectured that for every ϵ>0 and Δ there exists g such that the fractional total chromatic nu...
If G is a simple graph with minimum degree (G) satisfying (G) f(|V(G|+1) the total chromatic number ...
AbstractThe total chromatic number χT(G) of a graph G is the least number of colours needed to colou...
Let G be a graph and let s be the maximum number of vertices of the same degree, each at least (∆(G)...
AbstractThe total chromatic number χT(G) of a graph G is the minimum number of colours needed to col...
A total coloring of a graph G is a combination of vertex and edge colorings of G. In other words, is...
AbstractThe total chromatic number χt(G) of a graph G is the least number of colors needed to color ...
Add to ORKG