Bounded clique cover of some sparse graphs (Q2359963): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partition into cliques for cubic graphs: Planar case, complexity and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of approximating bounded variants of optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Combinatorial Optimization Problems on <i>d</i>‐Dimensional Boxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence in graphs with maximum degree four / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5520564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complements of nearly perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic gap and its extremes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The independence number in graphs of maximum degree three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets and matchings in subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence and matching number in graphs with maximum degree 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding independent sets in \(K_4\)-free 4-regular connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical graphs with connected complements / rank
 
Normal rank

Latest revision as of 01:16, 14 July 2024

scientific article
Language Label Description Also known as
English
Bounded clique cover of some sparse graphs
scientific article

    Statements

    Bounded clique cover of some sparse graphs (English)
    0 references
    0 references
    23 June 2017
    0 references
    clique cover
    0 references
    \(\theta\)-bounded
    0 references
    bounded degree graphs
    0 references
    PTAS
    0 references

    Identifiers