2-distance coloring of a planar graph without 3, 4, 7-cycles (Q328716): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-015-9873-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2008200916 / 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: A bound on the chromatic number of the square of a planar graph / 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: 2-Distance coloring of planar graphs without short cycles / 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: Coloring the square of a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling Planar Graphs with Conditions on Girth and Distance Two / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:17, 12 July 2024

scientific article
Language Label Description Also known as
English
2-distance coloring of a planar graph without 3, 4, 7-cycles
scientific article

    Statements

    Identifiers

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