On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs
From MaRDI portal
Publication:1750669
DOI10.11650/tjm/6499zbMath1387.05100OpenAlexW2603824681MaRDI QIDQ1750669
Jin Xu, Chanjuan Liu, En-Qiang Zhu
Publication date: 23 May 2018
Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.twjm/1498750951
generalized Mycielski graphsadjacent vertex-distinguishing total chromatic numberadjacent vertex-distinguishing total coloring
Related Items (1)
Cites Work
- Unnamed Item
- Total chromatic number of generalized Mycielski graphs
- Edge-chromatic numbers of Mycielski graphs
- On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
- Adjacent vertex distinguishing total coloring of graphs with lower average degree
- Adjacent vertex distinguishing total colorings of outerplanar graphs
- Concise proofs for adjacent vertex-distinguishing total colorings
- Circular chromatic numbers of Mycielski's graphs
- Circular chromatic number and a generalization of the construction of Mycielski.
- Circular chromatic number for iterated Mycielski graphs
- The list chromatic index of a bipartite multigraph
- The adjacent vertex distinguishing total coloring of planar graphs
- On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
- On adjacent-vertex-distinguishing total coloring of graphs
- Fractional chromatic numbers of cones over graphs
- The (Adjacent) Vertex-Distinguishing Total Coloring of the Mycielski Graphs and the Cartesian Product Graphs
- Vertex-distinguishing proper edge-colorings
- The fractional chromatic number of mycielski's graphs
- Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
- Sur le coloriage des graphs
- Circular chromatic number and Mycielski graphs
This page was built for publication: On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs