Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs (Q2514004): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree / 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: A bound on the total chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the total-neighbor-distinguishing index by sums / 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: 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: On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent vertex distinguishing total colorings of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On adjacent-vertex-distinguishing total coloring of graphs / rank
 
Normal rank

Latest revision as of 14:19, 9 July 2024

scientific article
Language Label Description Also known as
English
Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
scientific article

    Statements

    Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs (English)
    0 references
    0 references
    0 references
    0 references
    29 January 2015
    0 references
    \(K_4\)-minor free graph
    0 references
    neighbor sum distinguishing
    0 references

    Identifiers