Coloring the square of graphs whose maximum average degree is less than 4 (Q906469): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2015.11.012 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W584708941 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1506.04401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Distance Coloring of Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List coloring the square of sparse graphs with large degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring squares of planar graphs with girth six / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling Planar Graphs with Conditions on Girth and Distance Two / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2015.11.012 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:05, 10 December 2024

scientific article
Language Label Description Also known as
English
Coloring the square of graphs whose maximum average degree is less than 4
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references