A note on the minimum total coloring of planar graphs (Q326982): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10114-016-5427-1 / rank
Normal rank
 
Property / author
 
Property / author: Hui-Juan Wang / rank
Normal rank
 
Property / author
 
Property / author: Bin Liu / rank
Normal rank
 
Property / author
 
Property / author: Hui-Juan Wang / rank
Normal rank
 
Property / author
 
Property / author: Hong Wei Gao / rank
Normal rank
 
Property / author
 
Property / author: Hui-Juan Wang / 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/s10114-016-5427-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2460135050 / 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: Edge and total coloring of interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable / 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: Total-Coloring of Plane Graphs with Maximum Degree Nine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total colouring regular bipartite graphs 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: Q2860804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME UNSOLVED PROBLEMS IN GRAPH THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total coloring of planar graphs without chordal short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum total coloring of planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total coloring of planar graphs without some chordal 6-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total colourings of graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10114-016-5427-1 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:27, 9 December 2024

scientific article
Language Label Description Also known as
English
A note on the minimum total coloring of planar graphs
scientific article

    Statements

    A note on the minimum total coloring of planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 October 2016
    0 references
    planar graph
    0 references
    total coloring
    0 references
    cycle
    0 references

    Identifiers