On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs (Q1750669): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-distinguishing proper edge-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular chromatic numbers of Mycielski's graphs / 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: Total chromatic number of generalized Mycielski graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular chromatic number and Mycielski graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The list chromatic index of a bipartite multigraph / 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: Concise proofs for adjacent vertex-distinguishing total colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-chromatic numbers of Mycielski graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular chromatic number and a generalization of the construction of Mycielski. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fractional chromatic number of mycielski's graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular chromatic number for iterated Mycielski graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le coloriage des graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The (Adjacent) Vertex-Distinguishing Total Coloring of the Mycielski Graphs and the Cartesian Product Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional chromatic numbers of cones over graphs / 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: The adjacent vertex distinguishing total coloring of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent vertex distinguishing total coloring of graphs with lower average degree / 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

Latest revision as of 16:45, 15 July 2024

scientific article
Language Label Description Also known as
English
On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs
scientific article

    Statements

    On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs (English)
    0 references
    0 references
    0 references
    0 references
    23 May 2018
    0 references
    adjacent vertex-distinguishing total coloring
    0 references
    adjacent vertex-distinguishing total chromatic number
    0 references
    generalized Mycielski graphs
    0 references
    0 references

    Identifiers