Colouring diamond-free graphs (Q2402373)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Colouring diamond-free graphs	scientific article

Statements

scholarly article

0 references

Colouring diamond-free graphs (English)

0 references

Konrad K. Dabrowski

0 references

François Dross

0 references

Daniël Paulusma

0 references

Journal of Computer and System Sciences

0 references

publication date

7 September 2017

0 references

full work available at URL

https://arxiv.org/abs/1512.07849

0 references

zbMATH Keywords

graph colouring

0 references

diamond-free

0 references

clique-width

0 references

forbidden induced subgraph

0 references

describes a project that uses

CriticalPfreeGraphs

0 references

MaRDI profile type

MaRDI publication profile

0 references

On (\(P_{5}\), diamond)-free graphs

0 references

0 references

Graph classes with and without powers of bounded clique-width

0 references

Bounding the clique-width of \(H\)-free split graphs

0 references

Bounding the Clique‐Width of <i>H</i>‐Free Chordal Graphs

0 references

Clique-width for 4-vertex forbidden subgraphs

0 references

Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences

0 references

0 references

GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH

0 references

Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width

0 references

Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.

0 references

Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time

0 references

0 references

Obstructions for three-coloring graphs with one forbidden induced subgraph

0 references

Linear time solvable optimization problems on graphs of bounded clique-width

0 references

Colouring Diamond-free Graphs.

0 references

Colouring of graphs with Ramsey-type forbidden subgraphs

0 references

Bounding clique-width via perfect graphs

0 references

Colouring vertices of triangle-free graphs without forests

0 references

Classifying the clique-width of \(H\)-free bipartite graphs

0 references

0 references

BIPARTITE GRAPHS TOTALLY DECOMPOSABLE BY CANONICAL DECOMPOSITION

0 references

A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs

0 references

0 references

The behavior of clique-width under graph operations and graph transformations

0 references

Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs

0 references

Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes

0 references

Recent developments on graphs of bounded clique-width

0 references

Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences

0 references

Edge dominating set and colorings on graphs with fixed clique-width

0 references

0 references

0 references

Bipartite graphs without a skew star

0 references

Vertex coloring of graphs with few obstructions

0 references

On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree

0 references

ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P<sub>4</sub>'S

0 references

The coloring problem for classes with two small obstructions

0 references

Two cases of polynomial-time solvability for the coloring problem

0 references

Approximating rank-width and clique-width quickly

0 references

Vertex colouring and forbidden subgraphs -- a survey

0 references

MSOL partitioning problems on graphs of bounded treewidth and clique-width

0 references

Some new hereditary classes where graph coloring remains NP-hard

0 references

Coloring perfect \((K_ 4\)-e)-free graphs

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

10.1016/J.JCSS.2017.06.005

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2402373

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2402373&oldid=39060626"