Add to ORKGA wheel is a graph formed by a chordless cycle and a vertex that has at least three neighbors in the cycle. We prove that every 3-connected graph that does not contain a wheel as a subgraph is in fact minimally 3-connected. We prove that every graph that does not contain a wheel as a subgraph is 3-colorable
AbstractIn this paper we prove that every planar graph without cycles of length 4, 5, 6 and 8 is 3-c...
AbstractWe prove a decomposition theorem for graphs that do not contain a subdivision of K4 as an in...
Let G be a plane graph of girth at least five. We show that if there exists a 3-coloring of a cycle ...
A wheel is a graph formed by a chordless cycle and a vertex that has at least three neighbors in the...
A wheel is a graph formed by a chordless cycle C and a vertex u not in C that has at least three nei...
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...
International audienceA \emph{wheel} is a graph formed by a chordless cycle $C$ and a vertex $u$ not...
AbstractAn edgeeof a minimally 3-connected graphGis non-essential if and only if the graph obtained ...
We show that triangle-free graphs that do not contain an induced subgraph isomorphic to a subdivisio...
International audienceWe show that triangle-free graphs that do not contain an induced subgraph isom...
An edge e of a simple 3-connected graph G is essential if neither the deletion G\e nor the contracti...
AbstractIn this paper we prove that every planar graph without cycles of length 4, 5, 6 and 8 is 3-c...
AbstractWe prove a decomposition theorem for graphs that do not contain a subdivision of K4 as an in...
Let G be a plane graph of girth at least five. We show that if there exists a 3-coloring of a cycle ...
A wheel is a graph formed by a chordless cycle and a vertex that has at least three neighbors in the...
A wheel is a graph formed by a chordless cycle C and a vertex u not in C that has at least three nei...
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...
International audienceA \emph{wheel} is a graph formed by a chordless cycle $C$ and a vertex $u$ not...
AbstractAn edgeeof a minimally 3-connected graphGis non-essential if and only if the graph obtained ...
We show that triangle-free graphs that do not contain an induced subgraph isomorphic to a subdivisio...
International audienceWe show that triangle-free graphs that do not contain an induced subgraph isom...
An edge e of a simple 3-connected graph G is essential if neither the deletion G\e nor the contracti...
AbstractIn this paper we prove that every planar graph without cycles of length 4, 5, 6 and 8 is 3-c...
AbstractWe prove a decomposition theorem for graphs that do not contain a subdivision of K4 as an in...
Let G be a plane graph of girth at least five. We show that if there exists a 3-coloring of a cycle ...