A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five (Q520529): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10114-016-5480-9 / rank
Normal rank
 
Property / author
 
Property / author: Jian Liang Wu / rank
Normal rank
 
Property / author
 
Property / author: Jian Liang Wu / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6699853 / rank
 
Normal rank
Property / zbMATH Keywords
 
1-planar graph
Property / zbMATH Keywords: 1-planar graph / rank
 
Normal rank
Property / zbMATH Keywords
 
total coloring
Property / zbMATH Keywords: total coloring / rank
 
Normal rank
Property / zbMATH Keywords
 
discharging method
Property / zbMATH Keywords: discharging method / rank
 
Normal rank
Property / zbMATH Keywords
 
girth
Property / zbMATH Keywords: girth / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10114-016-5480-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2531438039 / 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: List edge and list total colourings of multigraphs / 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: A note on total colorings of 1-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total colorings of planar graphs without small cycles / 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: Ein Sechsfarbenproblem auf der Kugel / 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: Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable / 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 Chromatic Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5564127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total colorings of planar graphs without chordal 6-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total chromatic number of planar graphs with maximum degree ten / rank
 
Normal rank
Property / cites work
 
Property / cites work: On total colorings of 1-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On edge colorings of \(1\)-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List edge and list total coloring of 1-planar graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10114-016-5480-9 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:15, 9 December 2024

scientific article
Language Label Description Also known as
English
A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five
scientific article

    Statements

    A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 April 2017
    0 references
    1-planar graph
    0 references
    total coloring
    0 references
    discharging method
    0 references
    girth
    0 references

    Identifiers