Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles (Q2282476): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q129587078, #quickstatements; #temporary_batch_1724809781087
 
(4 intermediate revisions by 4 users not shown)
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.7151/dmgt.2122 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2810616411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / 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: Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree / 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: Q4604358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing total coloring of planar graphs without 5-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing total colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4604100 / 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: Q2811835 / 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 neighbor sum distinguishing total coloring of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing total choosability of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the neighbor sum distinguishing total coloring of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing total coloring of planar graphs without 4-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing total choosability of planar graphs without 4-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles / 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: Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing total coloring of 2-degenerate graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129587078 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:09, 28 August 2024

scientific article
Language Label Description Also known as
English
Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles
scientific article

    Statements

    Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles (English)
    0 references
    0 references
    0 references
    8 January 2020
    0 references
    neighbor sum distinguishing total coloring
    0 references
    discharging method
    0 references
    planar graph
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers