The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2010.12.014 / rank
Normal rank
 
Property / author
 
Property / author: Celina M. Herrera de Figueiredo / rank
Normal rank
 
Property / author
 
Property / author: Celina M. Herrera de Figueiredo / rank
 
Normal rank
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.1016/j.dam.2010.12.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1971556138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cliques and extended triangles. A necessary condition for planar clique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of clique graph recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4489142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics on perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of graphs into one or two independent sets and cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of some problems related to GRAPH 3-COLORABILITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stable cutsets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the List Partition Problem for Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The homogeneous set sandwich problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4697576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical star multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Berge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Berge trigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star-cutsets and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(2K_{2}\) vertex-set partition into nonempty parts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decision and optimization (\(k\),\(l\))-graph sandwich problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding<i>H</i>-partitions efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On edge-colouring indifference graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4487452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4521527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graph sandwich problem for 1-join composition is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Sandwich Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3839009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial characterization of clique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic index of complete multipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: an ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Skew Partition Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic index of graphs with no cycle with a unique chord / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total chromatic number of {square,unichord}-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Intersection Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On clique-complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to find overfull subgraphs in graphs with large maximum degree. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing and edge-colouring split-indifference graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distances and diameters on iterated clique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic index of graphs with a spanning star / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4867717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-inverse graphs ofK3-free andK4-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex colouring and forbidden subgraphs -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Skew partitions in perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of clique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-colouring of join graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-colouring of regular graphs of large degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification and characterizations of snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal bipartite completion of colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique Graphs of Chordal and Path Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sandwich problem for cutsets: clique cutset, \(k\)-star cutset / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial dichotomy for three nonempty part sandwich problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The external constraint 4 nonempty part sandwich problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Skew partition sandwich problem is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structure theorem for graphs with no cycle with a unique chord and its consequences / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2010.12.014 / rank
 
Normal rank

Latest revision as of 08:58, 11 December 2024

scientific article
Language Label Description Also known as
English
The P versus NP-complete dichotomy of some challenging problems in graph theory
scientific article

    Statements

    The P versus NP-complete dichotomy of some challenging problems in graph theory (English)
    0 references
    22 November 2012
    0 references
    analysis of algorithms
    0 references
    problem complexity
    0 references
    graph algorithms
    0 references
    structural characterization of types of graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references