Minimal classes of graphs of unbounded clique-width (Q659655): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00026-011-0117-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2153230366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness results for some problems on subclasses of bipartite and chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4667625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-width for 4-vertex forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof that `proper = unit' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jump number maximization for proper interval graphs and series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper interval graphs and the guard problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions for the edge colouring of reduced indifference graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter and treewidth in minor-closed graph families, revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter and treewidth in minor-closed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-width minimization is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: On semi-\(P_ 4\)-sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local tree-width, excluded minors, and approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Difference graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interval graph is a comparability graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth of chain graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge dominating set and colorings on graphs with fixed clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal bipartite graphs of bounded tree- and clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3568753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P<sub>4</sub>'S / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precoloring extension on unit interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. V. Excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal path cover problem on block graphs and bipartite permutation graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:21, 4 July 2024

scientific article
Language Label Description Also known as
English
Minimal classes of graphs of unbounded clique-width
scientific article

    Statements

    Minimal classes of graphs of unbounded clique-width (English)
    0 references
    0 references
    24 January 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    clique-width
    0 references
    bipartite permutation graphs
    0 references
    unit interval graphs
    0 references
    fixed parameter tractability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references