International audienceWe give a short proof of the following theorem due to Borodin (1990). Every planar graph G with maximum degree at least 9 is (Δ(G)+1)-edge-choosable
60 pages, 61 figuresTotal coloring is a variant of edge coloring where both vertices and edges are t...
AbstractIt is proved that a planar graph G without five cycles is three degenerate, hence, four choo...
AbstractA well-known conjecture of Vizing (the planar graph conjecture) states that every plane grap...
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...
International audienceWe give a short proof of the following theorem due to Borodin (1990). Every pl...
AbstractWe give a short proof of the following theorem due to Borodin (1990) [2]. Every planar graph...
AbstractWe give a short proof of the following theorem due to Borodin (1990) [2]. Every planar graph...
Partially supported by the ANR Blanc AGAPE and ANR Blanc International-Taiwan GRATEL. We give a shor...
We give a short proof of the following theorem due to Borodin~\cite{Bor90}. Every planar graph with ...
AbstractLet G be a planar graph with maximum degree 4. It is known that G is 8-totally choosable. It...
AbstractWe investigate structural properties of planar graphs without triangles or without 4-cycles,...
[[abstract]]Let G be a planar graph without 3-cycles or 4-cycles. We investi- gate light edges and l...
[[abstract]]Let G be a planar graph without 3-cycles or 4-cycles. We investi- gate light edges and l...
60 pages, 61 figuresTotal coloring is a variant of edge coloring where both vertices and edges are t...
AbstractIt is proved that a planar graph G without five cycles is three degenerate, hence, four choo...
AbstractA well-known conjecture of Vizing (the planar graph conjecture) states that every plane grap...
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...
International audienceWe give a short proof of the following theorem due to Borodin (1990). Every pl...
AbstractWe give a short proof of the following theorem due to Borodin (1990) [2]. Every planar graph...
AbstractWe give a short proof of the following theorem due to Borodin (1990) [2]. Every planar graph...
Partially supported by the ANR Blanc AGAPE and ANR Blanc International-Taiwan GRATEL. We give a shor...
We give a short proof of the following theorem due to Borodin~\cite{Bor90}. Every planar graph with ...
AbstractLet G be a planar graph with maximum degree 4. It is known that G is 8-totally choosable. It...
AbstractWe investigate structural properties of planar graphs without triangles or without 4-cycles,...
[[abstract]]Let G be a planar graph without 3-cycles or 4-cycles. We investi- gate light edges and l...
[[abstract]]Let G be a planar graph without 3-cycles or 4-cycles. We investi- gate light edges and l...
60 pages, 61 figuresTotal coloring is a variant of edge coloring where both vertices and edges are t...
AbstractIt is proved that a planar graph G without five cycles is three degenerate, hence, four choo...
AbstractA well-known conjecture of Vizing (the planar graph conjecture) states that every plane grap...
DOI
Add to ORKG