scientific article; zbMATH DE number 1979486
From MaRDI portal
Publication:4425939
zbMath1020.05046MaRDI QIDQ4425939
Publication date: 14 September 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2518/25180044.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (31)
On the structure of graphs without claw, \(4K_1\) and co-R ⋮ Colouring diamond-free graphs ⋮ Complexity classification of the edge coloring problem for a family of graph classes ⋮ Complete complexity dichotomy for $7$-edge forbidden subgraphs in the edge coloring problem ⋮ Interval function, induced path function, (claw, paw)-free graphs and axiomatic characterizations ⋮ Bounding the Clique-Width of H-free Chordal Graphs ⋮ Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs ⋮ Bounding the mim‐width of hereditary graph classes ⋮ Clique‐width: Harnessing the power of atoms ⋮ Graph classes with and without powers of bounded clique-width ⋮ Bounding clique-width via perfect graphs ⋮ Graphs of separability at most 2 ⋮ Clique-Width for Graph Classes Closed under Complementation ⋮ Unnamed Item ⋮ Classifying the clique-width of \(H\)-free bipartite graphs ⋮ Induced minor free graphs: isomorphism and clique-width ⋮ Unnamed Item ⋮ Graphs of Separability at Most Two: Structural Characterizations and Their Consequences ⋮ On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size ⋮ NP-hard graph problems and boundary classes of graphs ⋮ A new graph construction of unbounded clique-width ⋮ Critical hereditary graph classes: a survey ⋮ The behavior of clique-width under graph operations and graph transformations ⋮ Bounding the Mim-Width of Hereditary Graph Classes. ⋮ Recent developments on graphs of bounded clique-width ⋮ On the complexity of the dominating induced matching problem in hereditary classes of graphs ⋮ Bounding Clique-Width via Perfect Graphs ⋮ Bounding the clique-width of \(H\)-free split graphs ⋮ Unnamed Item ⋮ Chordal bipartite graphs of bounded tree- and clique-width ⋮ Critical elements in combinatorially closed families of graph classes
This page was built for publication:
