Q5009627 (Q5009627): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.ESA.2018.61 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of surjective homomorphism problems-a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contractibility and NP-completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the all-pair shortest path query problem on interval and circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416248 / 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: A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding<i>H</i>-partitions efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(2K_2\)-partition of some classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The P versus NP-complete dichotomy of some challenging problems in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: List homomorphisms to reflexive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5747399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering graphs with few complete bipartite subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph partitions with prescribed patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination When the Stars Are Out / rank
 
Normal rank
Property / cites work
 
Property / cites work: On disconnected cuts and separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing Cut Sets in a Graph by the Number of Their Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal disconnected cuts in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding χ in terms of ω and Δ for quasi-line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of disconnected cut and \(2 K_2\)-partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time recognition of circular-arc graphs / 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: Computational Complexity of Compaction to Reflexive Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Partition of Some Class of Graphs under Compaction / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.ESA.2018.61 / rank
 
Normal rank

Latest revision as of 15:36, 30 December 2024

scientific article; zbMATH DE number 7378731
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7378731

    Statements

    0 references
    0 references
    0 references
    4 August 2021
    0 references
    disconnected cut
    0 references
    surjective homomorphism
    0 references
    biclique cover
    0 references
    claw-freeness
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers