On the neighbor sum distinguishing total coloring of planar graphs (Q897872): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2015.09.017 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2015.09.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1773291652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3824455 / 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 planar graphs with maximum degree \(\varDelta\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The adjacent vertex distinguishing total chromatic number / 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: Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz / 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: Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the adjacent vertex distinguishing total chromatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted-1-antimagic graphs of prime power order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-coloring edge-weightings: towards the 1-2-3-conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge weights and vertex colours / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irregularity strength of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3575472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total weight choosability of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of edge 3-colorings of a planar cubic graph as a permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: The adjacent vertex distinguishing total coloring of planar 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: Total weight choosability of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antimagic labelling of vertex weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On adjacent-vertex-distinguishing total coloring of graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2015.09.017 / rank
 
Normal rank

Latest revision as of 07:40, 10 December 2024

scientific article
Language Label Description Also known as
English
On the neighbor sum distinguishing total coloring of planar graphs
scientific article

    Statements

    On the neighbor sum distinguishing total coloring of planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 December 2015
    0 references
    neighbor sum distinguishing total coloring
    0 references
    planar graph
    0 references
    total coloring
    0 references
    discharging
    0 references
    combinatorial nullstellensatz
    0 references
    0 references
    0 references

    Identifiers