General vertex-distinguishing total coloring of graphs
From MaRDI portal
Publication:2336778
DOI10.1155/2014/849748zbMath1442.05062OpenAlexW2082529547WikidataQ59052803 ScholiaQ59052803MaRDI QIDQ2336778
Publication date: 19 November 2019
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/849748
Cites Work
- AVDTC numbers of generalized Halin graphs with maximum degree at least 6
- On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
- Adjacent vertex distinguishing total colorings of outerplanar graphs
- Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes
- Concise proofs for adjacent vertex-distinguishing total colorings
- Chromatic scheduling and frequency assignment
- Adjacent strong edge coloring of graphs
- A note on the adjacent vertex distinguishing total chromatic number of graphs
- On the AVDTC of 4-regular graphs
- The adjacent vertex distinguishing total coloring of planar graphs
- On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
- General neighbour-distinguishing index of a graph
- On adjacent-vertex-distinguishing total coloring of graphs
- A graph coloring algorithm for large scheduling problems
- Vertex-distinguishing proper edge-colorings
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: General vertex-distinguishing total coloring of graphs