Chromatic numbers of exact distance graphs (Q1633747): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q200923 / rank
Normal rank
 
Property / author
 
Property / author: Henry A. Kierstead / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963893440 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1612.02160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Powers of Planar Graphs / rank
 
Normal rank
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: Graphs with linearly bounded Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring and Covering Nowhere Dense Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generalised colouring numbers of graphs that exclude a fixed minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple competitive graph coloring algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Graph Packing via Game Colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radius two trees specify χ‐bounded classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive colorings of oriented graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orderings on graphs and game coloring number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5552096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5589872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on the distance-colouring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and approximation algorithms for channel assignment in radio networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Walk-powers and homomorphism bounds of planar signed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-depth, subgraph coloring and homomorphism bounds / 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: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On low tree-depth decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short note about pursuit games played on a graph with a given genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refined activation strategy for the marking game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring graphs with bounded generalized colouring number / rank
 
Normal rank

Latest revision as of 18:39, 17 July 2024

scientific article
Language Label Description Also known as
English
Chromatic numbers of exact distance graphs
scientific article

    Statements

    Chromatic numbers of exact distance graphs (English)
    0 references
    0 references
    0 references
    0 references
    20 December 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    bounded expansion
    0 references
    chromatic number
    0 references
    exact distance graphs
    0 references
    generalised colouring numbers
    0 references
    planar graphs
    0 references
    0 references
    0 references