Add to ORKGIn 1965, Vizing proved that planar graphs of maximum degree at least eight have the edge chromatic number equal to their maximum degree. He conjectured the same if the maximum degree is either six or seven. This article proves the maximum degree seven case. © 2001 Academic Press
International audienceWe give a short proof of the following theorem due to Borodin (1990). Every pl...
International audienceWe give a short proof of the following theorem due to Borodin (1990). Every pl...
International audienceWe give a short proof of the following theorem due to Borodin (1990). Every pl...
In 1965, Vizing proved that planar graphs of maximum degree at least eight have the edge chromatic n...
AbstractIn 1965, Vizing proved that planar graphs of maximum degree at least eight have the edge chr...
AbstractA well-known conjecture of Vizing (the planar graph conjecture) states that every plane grap...
A total k-coloring of a graph is an assignment of k colors to its vertices and edges such that no tw...
In this paper, by applying the discharging method, we show that if G is a planar graph with a maximu...
AbstractA well-known conjecture of Vizing (the planar graph conjecture) states that every plane grap...
AbstractThe total chromatic number of a graph G, denoted by χ″(G), is the minimum number of colors n...
AbstractLet G be a planar graph with maximum degree Δ≥7 and without intersecting 3-cycles; that is, ...
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one othe...
International audienceWe give a short proof of the following theorem due to Borodin (1990). Every pl...
International audienceWe give a short proof of the following theorem due to Borodin (1990). Every pl...
Partially supported by the ANR Blanc AGAPE and ANR Blanc International-Taiwan GRATEL. We give a shor...
International audienceWe give a short proof of the following theorem due to Borodin (1990). Every pl...
International audienceWe give a short proof of the following theorem due to Borodin (1990). Every pl...
International audienceWe give a short proof of the following theorem due to Borodin (1990). Every pl...
In 1965, Vizing proved that planar graphs of maximum degree at least eight have the edge chromatic n...
AbstractIn 1965, Vizing proved that planar graphs of maximum degree at least eight have the edge chr...
AbstractA well-known conjecture of Vizing (the planar graph conjecture) states that every plane grap...
A total k-coloring of a graph is an assignment of k colors to its vertices and edges such that no tw...
In this paper, by applying the discharging method, we show that if G is a planar graph with a maximu...
AbstractA well-known conjecture of Vizing (the planar graph conjecture) states that every plane grap...
AbstractThe total chromatic number of a graph G, denoted by χ″(G), is the minimum number of colors n...
AbstractLet G be a planar graph with maximum degree Δ≥7 and without intersecting 3-cycles; that is, ...
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one othe...
International audienceWe give a short proof of the following theorem due to Borodin (1990). Every pl...
International audienceWe give a short proof of the following theorem due to Borodin (1990). Every pl...
Partially supported by the ANR Blanc AGAPE and ANR Blanc International-Taiwan GRATEL. We give a shor...
International audienceWe give a short proof of the following theorem due to Borodin (1990). Every pl...
International audienceWe give a short proof of the following theorem due to Borodin (1990). Every pl...
International audienceWe give a short proof of the following theorem due to Borodin (1990). Every pl...