Neighbor sum distinguishing total choosability of planar graphs without 4-cycles (Q277657): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2016.02.003 / rank
Normal rank
 
Property / author
 
Property / author: Ji Hui Wang / rank
Normal rank
 
Property / author
 
Property / author: Jian-Sheng Cai / rank
Normal rank
 
Property / author
 
Property / author: Qiao Ling Ma / rank
Normal rank
 
Property / author
 
Property / author: Ji Hui Wang / rank
 
Normal rank
Property / author
 
Property / author: Jian-Sheng Cai / rank
 
Normal rank
Property / author
 
Property / author: Qiao Ling Ma / 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.1016/j.dam.2016.02.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2296149237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / 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 (set) distinguishing total choosability via the combinatorial Nullstellensatz / 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 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: Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs / 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: Bounding the weight choosability number of a graph / 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: Neighbor sum distinguishing total colorings of triangle free 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: On adjacent-vertex-distinguishing total coloring of graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2016.02.003 / rank
 
Normal rank

Latest revision as of 13:16, 9 December 2024

scientific article
Language Label Description Also known as
English
Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
scientific article

    Statements

    Neighbor sum distinguishing total choosability of planar graphs without 4-cycles (English)
    0 references
    2 May 2016
    0 references
    neighbor sum distinguishing total coloring
    0 references
    choosability
    0 references
    combinatorial nullstellensatz
    0 references
    planar graph
    0 references
    0 references
    0 references
    0 references

    Identifiers