International audienceA \emph{wheel} is a graph formed by a chordless cycle $C$ and a vertex $u$ not in $C$ that has at least three neighbors in $C$. We prove that every 3-connected planar graph that does not contain a wheel as an induced subgraph is either a line graph or has a clique cutset. We prove that every planar graph that does not contain a wheel as an induced subgraph is 3-colorable
AbstractPlanar graphs without 3-cycles at distance less than 4 and without 5-cycles are proved to be...
AbstractSteinberg's question from 1975 whether every planar graph without 4- and 5-cycles is 3-color...
AbstractA graph G is k-choosable if every vertex of G can be properly colored whenever every vertex ...
International audienceA \emph{wheel} is a graph formed by a chordless cycle $C$ and a vertex $u$ not...
International audienceA \emph{wheel} is a graph formed by a chordless cycle $C$ and a vertex $u$ not...
International audienceA \emph{wheel} is a graph formed by a chordless cycle $C$ and a vertex $u$ not...
International audienceA \emph{wheel} is a graph formed by a chordless cycle $C$ and a vertex $u$ not...
International audienceA \emph{wheel} is a graph formed by a chordless cycle $C$ and a vertex $u$ not...
A wheel is a graph formed by a chordless cycle C and a vertex u not in C that has at least three nei...
A wheel is a graph formed by a chordless cycle and a vertex that has at least three neighbors in the...
AbstractIn this paper we prove that every planar graph without cycles of length 4, 5, 6 and 8 is 3-c...
In this paper we prove that every planar graph without 4, 5 and 8-cycles is 3-colorable
In this paper we prove that every planar graph without 4, 5 and 8-cycles is 3-colorable
A wheel is a graph formed by a chordless cycle and a vertex that has at least three neighbors in the...
AbstractWe prove that every planar graph in which no i-cycle is adjacent to a j-cycle whenever 3≤i≤j...
AbstractPlanar graphs without 3-cycles at distance less than 4 and without 5-cycles are proved to be...
AbstractSteinberg's question from 1975 whether every planar graph without 4- and 5-cycles is 3-color...
AbstractA graph G is k-choosable if every vertex of G can be properly colored whenever every vertex ...
International audienceA \emph{wheel} is a graph formed by a chordless cycle $C$ and a vertex $u$ not...
International audienceA \emph{wheel} is a graph formed by a chordless cycle $C$ and a vertex $u$ not...
International audienceA \emph{wheel} is a graph formed by a chordless cycle $C$ and a vertex $u$ not...
International audienceA \emph{wheel} is a graph formed by a chordless cycle $C$ and a vertex $u$ not...
International audienceA \emph{wheel} is a graph formed by a chordless cycle $C$ and a vertex $u$ not...
A wheel is a graph formed by a chordless cycle C and a vertex u not in C that has at least three nei...
A wheel is a graph formed by a chordless cycle and a vertex that has at least three neighbors in the...
AbstractIn this paper we prove that every planar graph without cycles of length 4, 5, 6 and 8 is 3-c...
In this paper we prove that every planar graph without 4, 5 and 8-cycles is 3-colorable
In this paper we prove that every planar graph without 4, 5 and 8-cycles is 3-colorable
A wheel is a graph formed by a chordless cycle and a vertex that has at least three neighbors in the...
AbstractWe prove that every planar graph in which no i-cycle is adjacent to a j-cycle whenever 3≤i≤j...
AbstractPlanar graphs without 3-cycles at distance less than 4 and without 5-cycles are proved to be...
AbstractSteinberg's question from 1975 whether every planar graph without 4- and 5-cycles is 3-color...
AbstractA graph G is k-choosable if every vertex of G can be properly colored whenever every vertex ...
DOI
Add to ORKG