AbstractA plane graph G is said to be k-edge-face choosable if, for every list L of colors satisfying |L(x)|=k for every edge and face x, there exists a coloring which assigns to each edge and each face a color from its list so that any adjacent or incident elements receive different colors. We prove that every plane graph G with maximum degree Δ (G) is (Δ (G)+3)-edge-face choosable
International audienceAn edge-face colouring of a plane graph with edge set E and face set F is a co...
[[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...
AbstractA plane graph is called entirely k-choosable if for any list assignment L such that ∣L(x)∣=k...
International audienceAn edge-face coloring of a plane graph with edge set E and face set F is a col...
AbstractThe edges and faces of a plane graph are colored so that every two adjacent or incident of t...
AbstractA plane graph is called entirely k-choosable if for any list assignment L such that ∣L(x)∣=k...
In a previous paper, the authors proved a conjecture of Melnikov that the edges and faces of a plane...
An edge-face coloring of a plane graph with edge set $E$ and face set $F$ is a coloring of the eleme...
textabstractAn edge-face coloring of a plane graph with edge set $E$ and face set $F$ is a coloring ...
Abstract The edge-face chromatic number χef(G) of a plane graph G is the least number of colors assi...
A graph G is edge-L-colorable if for a given edge assignment L = {L(e) : e ∈ E(G)}, there exists a p...
A graph is k-choosable if it can be colored whenever every vertex has a list of available colors of ...
AbstractIt is proved that if G is a plane embedding of a K4-minor-free graph with maximum degree Δ, ...
In a previous paper, the authors proved a conjecture of Melnikov that the edges and faces of a plane...
International audienceAn edge-face colouring of a plane graph with edge set E and face set F is a co...
[[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...
AbstractA plane graph is called entirely k-choosable if for any list assignment L such that ∣L(x)∣=k...
International audienceAn edge-face coloring of a plane graph with edge set E and face set F is a col...
AbstractThe edges and faces of a plane graph are colored so that every two adjacent or incident of t...
AbstractA plane graph is called entirely k-choosable if for any list assignment L such that ∣L(x)∣=k...
In a previous paper, the authors proved a conjecture of Melnikov that the edges and faces of a plane...
An edge-face coloring of a plane graph with edge set $E$ and face set $F$ is a coloring of the eleme...
textabstractAn edge-face coloring of a plane graph with edge set $E$ and face set $F$ is a coloring ...
Abstract The edge-face chromatic number χef(G) of a plane graph G is the least number of colors assi...
A graph G is edge-L-colorable if for a given edge assignment L = {L(e) : e ∈ E(G)}, there exists a p...
A graph is k-choosable if it can be colored whenever every vertex has a list of available colors of ...
AbstractIt is proved that if G is a plane embedding of a K4-minor-free graph with maximum degree Δ, ...
In a previous paper, the authors proved a conjecture of Melnikov that the edges and faces of a plane...
International audienceAn edge-face colouring of a plane graph with edge set E and face set F is a co...
[[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...
DOI
Add to ORKG