Not necessarily proper total colourings which are adjacent vertex distinguishing (Q2874310): 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 / author
 
Property / author: Yu-ping Gao / rank
Normal rank
 
Property / author
 
Property / author: Yu-ping Gao / 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.1080/00207160.2013.786829 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074801803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(r\)-strong edge colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent Vertex Distinguishing Edge‐Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: General neighbour-distinguishing index of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new type of edge-derived vertex coloring / 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: Recent results on the total chromatic number / 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: On the adjacent vertex distinguishing edge colourings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME UNSOLVED PROBLEMS IN GRAPH THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total colourings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent strong edge coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On adjacent-vertex-distinguishing total coloring of graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:45, 7 July 2024

scientific article
Language Label Description Also known as
English
Not necessarily proper total colourings which are adjacent vertex distinguishing
scientific article

    Statements

    Not necessarily proper total colourings which are adjacent vertex distinguishing (English)
    0 references
    0 references
    0 references
    0 references
    29 January 2014
    0 references
    adjacent vertex distinguishing proper edge colouring
    0 references
    adjacent vertex distinguishing proper edge chromatic number
    0 references
    total colouring
    0 references
    adjacent vertex distinguishing not necessarily proper total colouring
    0 references
    adjacent vertex distinguishing not necessarily proper total chromatic number
    0 references

    Identifiers