Coloring 3-power of 3-subdivision of subcubic graph (Q4554572): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the total coloring of planar graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the total coloring of generalized Petersen graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A concise proof for total coloring subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On colorings of graph fractional powers / 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: Total coloring of planar graphs of maximum degree eight / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs of maximum degree seven are Class I / 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

Revision as of 09:08, 17 July 2024

scientific article; zbMATH DE number 6979592
Language Label Description Also known as
English
Coloring 3-power of 3-subdivision of subcubic graph
scientific article; zbMATH DE number 6979592

    Statements

    Coloring 3-power of 3-subdivision of subcubic graph (English)
    0 references
    0 references
    0 references
    14 November 2018
    0 references
    chromatic number
    0 references
    subdivision
    0 references
    \(k\)-power of graphs
    0 references
    total graphs
    0 references

    Identifiers