Some completion problems for graphs without chordless cycles of prescribed lengths (Q2274074): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q127596956, #quickstatements; #temporary_batch_1721940658196
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2019.05.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2955728877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of intervalizing four colored caterpillars / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Proper Interval Colored Graph problem for caterpillar trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two strikes against perfect phylogeny / rank
 
Normal rank
Property / cites work
 
Property / cites work: On intervalizing \(k\)-colored graphs for DNA physical mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting even holes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even-hole-free graphs part II: Recognition algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completing colored graphs to meet a target property / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the forbidden induced subgraph probe and sandwich problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chain graph sandwich problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the forbidden induced subgraph sandwich problem / 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: Graph Sandwich Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating Three-Colored Graphs in Linear Time and Linear Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating 3-Colored Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating Vertex-Colored Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal bipartite completion of colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127596956 / rank
 
Normal rank

Latest revision as of 21:55, 25 July 2024

scientific article
Language Label Description Also known as
English
Some completion problems for graphs without chordless cycles of prescribed lengths
scientific article

    Statements

    Some completion problems for graphs without chordless cycles of prescribed lengths (English)
    0 references
    0 references
    0 references
    19 September 2019
    0 references
    completion problem
    0 references
    sandwich problem
    0 references
    \(C_4\)-free graphs
    0 references
    \((C_4, \dots, C_s)\)-free graphs
    0 references
    \((C_4, C_6, \ldots, C_{2 s})\)-free graphs
    0 references

    Identifiers