Total colorings of planar graphs without small cycles (Q937252): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Jian-Feng Hou / rank
Normal rank
 
Property / author
 
Property / author: Gui Zhen Liu / rank
Normal rank
 
Property / author
 
Property / author: Jian Liang Wu / rank
Normal rank
 
Property / author
 
Property / author: Jian-Feng Hou / rank
 
Normal rank
Property / author
 
Property / author: Gui Zhen Liu / rank
 
Normal rank
Property / author
 
Property / author: Jian Liang Wu / rank
 
Normal rank
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/s00373-008-0778-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2009769735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the total coloring of planar graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total colorings of planar graphs with large maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total colourings of planar graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: List edge and list total colorings of planar graphs without 4-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The total coloring of a multigraph with maximal degree 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4163548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The total chromatic number of any multigraph with maximum degree five is at most seven / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the total coloring of certain graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the total colouring number is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: On total 9-coloring planar graphs of maximum degree seven / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Total Chromatic Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5564127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on total colorings of planar graphs without 4-cycles / rank
 
Normal rank

Latest revision as of 15:10, 28 June 2024

scientific article
Language Label Description Also known as
English
Total colorings of planar graphs without small cycles
scientific article

    Statements

    Identifiers