The adjacent vertex distinguishing total chromatic number (Q442409): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6064694 / rank
 
Normal rank
Property / zbMATH Keywords
 
proper total colouring
Property / zbMATH Keywords: proper total colouring / rank
 
Normal rank
Property / zbMATH Keywords
 
adjacent vertex distinguishing
Property / zbMATH Keywords: adjacent vertex distinguishing / rank
 
Normal rank
Property / zbMATH Keywords
 
chromatic number
Property / zbMATH Keywords: chromatic number / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973563055 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1009.1785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent Vertex Distinguishing Edge‐Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-distinguishing proper edge-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886768 / 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: Q4074927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concise proofs for adjacent vertex-distinguishing total colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3572447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration for self-bounding functions and an inequality of Talagrand / 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: Concentration of measure and isoperimetric inequalities in product spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: New concentration inequalities in product spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME UNSOLVED PROBLEMS IN GRAPH THEORY / 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: On adjacent-vertex-distinguishing total coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent strong edge coloring of graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:47, 5 July 2024

scientific article
Language Label Description Also known as
English
The adjacent vertex distinguishing total chromatic number
scientific article

    Statements

    The adjacent vertex distinguishing total chromatic number (English)
    0 references
    0 references
    0 references
    10 August 2012
    0 references
    proper total colouring
    0 references
    adjacent vertex distinguishing
    0 references
    chromatic number
    0 references

    Identifiers