DOIAbstract
AbstractWe characterize the class of claw-free b-perfect graphs by giving a complete description of their structure
AbstractWe characterize the class of claw-free b-perfect graphs by giving a complete description of their structure
The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circu...
AbstractThe b-chromatic number ϕ(G) of a graph G is defined as the largest number k for which the ve...
AbstractA graph is claw-free if no vertex has three pairwise nonadjacent neighbours. In earlier pape...
AbstractWe characterize the class of claw-free b-perfect graphs by giving a complete description of ...
AbstractWe present a polynomial-time algorithm to recognize claw-free perfect graphs. The algorithm ...
In 1988, Chvátal and Sbihi [4] proved a decomposition theorem for claw-free perfect graphs. They sho...
AbstractA b-coloring is a coloring of the vertices of a graph such that each color class contains a ...
AbstractA graph is claw-free if no vertex has three pairwise nonadjacent neighbours. In this series ...
A graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals the larg...
A graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals the larg...
International audienceThe circular chromatic number of a graph is a well-studied refinement of the c...
International audienceThe circular chromatic number of a graph is a well-studied refinement of the c...
AbstractA graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals ...
AbstractA b-coloring is a coloring of the vertices of a graph such that each color class contains a ...
AbstractIt is known that all claw-free perfect graphs can be decomposed via clique-cutsets into two ...
The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circu...
AbstractThe b-chromatic number ϕ(G) of a graph G is defined as the largest number k for which the ve...
AbstractA graph is claw-free if no vertex has three pairwise nonadjacent neighbours. In earlier pape...
AbstractWe characterize the class of claw-free b-perfect graphs by giving a complete description of ...
AbstractWe present a polynomial-time algorithm to recognize claw-free perfect graphs. The algorithm ...
In 1988, Chvátal and Sbihi [4] proved a decomposition theorem for claw-free perfect graphs. They sho...
AbstractA b-coloring is a coloring of the vertices of a graph such that each color class contains a ...
AbstractA graph is claw-free if no vertex has three pairwise nonadjacent neighbours. In this series ...
A graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals the larg...
A graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals the larg...
International audienceThe circular chromatic number of a graph is a well-studied refinement of the c...
International audienceThe circular chromatic number of a graph is a well-studied refinement of the c...
AbstractA graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals ...
AbstractA b-coloring is a coloring of the vertices of a graph such that each color class contains a ...
AbstractIt is known that all claw-free perfect graphs can be decomposed via clique-cutsets into two ...
The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circu...
AbstractThe b-chromatic number ϕ(G) of a graph G is defined as the largest number k for which the ve...
AbstractA graph is claw-free if no vertex has three pairwise nonadjacent neighbours. In earlier pape...
Add to ORKG