Distance-two coloring of sparse graphs (Q2441647): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Coloring with no 2-colored \(P_4\)'s / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to distance-two colouring of graphs on surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3679212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the vertex cover number of a hypergraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On forbidden subdivision characterizations of graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5752590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest planar graphs of diameter two and fixed maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improper Choosability and Property B / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time low tree-width partitions and algorithmic consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grad and classes with bounded expansion. I: Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grad and classes with bounded expansion. II: Algorithmic aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On nowhere dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XVI: Excluding a non-planar graph / rank
 
Normal rank

Latest revision as of 13:02, 7 July 2024

scientific article
Language Label Description Also known as
English
Distance-two coloring of sparse graphs
scientific article

    Statements

    Distance-two coloring of sparse graphs (English)
    0 references
    0 references
    0 references
    25 March 2014
    0 references
    \(\varSigma\)-coloring
    0 references
    classes of bounded expansion
    0 references
    nowhere-dense classes
    0 references

    Identifiers