[r,s,t]-colorings of graphs
The authors introduce \([r,s,t]\)-colorings of graphs, which generalize vertex colorings, edge colorings, and total colorings. Given non-negative integers \( k\), \(r\), \(s\) and \(t\), an \([r,s,t]\)-coloring of a graph \(G=(V(G),E(G))\) is a mapping \(c:V(G)\cup E(G)\rightarrow \{0,\dots,k-1\}\) such that \(\left| c(v_{i})-c(v_{j})\right| \geq r\) whenever the vertices \(v_{i}\) and \(v_{j} \) are adjacent, \(\left| c(e_{i})-c(e_{j})\right| \geq s\) whenever the edges \(e_{i}\) and \(e_{j}\) are adjacent, and \(\left| c(v_{i})-c(e_{j})\right| \geq t\) whenever the vertex \(v_{i}\) is incident on the edge \(e_{j}\). The \([r,s,t]\)-chromatic number \(\chi _{r,s,t}(G)\) is the least \(k\) such that \(G\) admits an \([r,s,t]\)-coloring with \(k\) colors. The paper includes several general results about \([r,s,t]\)-colorings; for instance \(\chi _{ar,as,at}(G)=1+a(\chi _{r,s,t}(G)-1)\) and \(r\chi (G)-r+s\chi ^{\prime }(G)-s+t+1\geq \chi _{r,s,t}(G)\geq 1+\max \{r\chi (G)-r,s\chi ^{\prime }(G)-s,t\}\). In addition, the values of \(\chi _{r,s,t}(G) \) with \(\min \{r,s,t\}\leq 1\) are discussed in detail.
- \([r, s, t; f]\)-coloring of graphs
- A note on \([r, s, c, t]\)-colorings of graphs
- \([r,s,t]\)-coloring of \(K_{n,n}\)
- \(T\)-colorings of graphs
- \([r,s,t]\)-coloring of trees and bipartite graphs
- \([r,s,t]\)-colorings of graph products
- \([r,s,t]\)-colourings of paths
- scientific article; zbMATH DE number 975370
- \([r, s, t]\)-colouring of paths, cycles and stars
- \((\mathcal{P},\mathcal{Q})\)-total \((r,s)\)-colorings of graphs
- 25 pretty graph colouring problems
- A bound on the total chromatic number
- scientific article; zbMATH DE number 3043302 (Why is no real title available?)
- On the total coloring of planar graphs.
- On total 9-coloring planar graphs of maximum degree seven
- The total chromatic number of any multigraph with maximum degree five is at most seven
- The total chromatic number of graphs having large maximum degree
- Total colourings of graphs
- \([r,s,t]\)-coloring of \(K_{n,n}\)
- On \((d,1)\)-total numbers of graphs
- \((2,1)\)-total labeling of trees with large maximum degree
- A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\)
- Facial \([r,s,t]\)-colorings of plane graphs
- \((2,1)\)-total labelling of outerplanar graphs
- Strict colourings of STS(\(3v\))s and uncolourable BSTS(\(3v\))s
- \(\left [r,s,t\right]\)-colorings of fans.
- \([1,1,2]\)-colorings of \(K_5\) and \(K_6\).
- \([1,1,2]\)-colorings of complete graphs
- \([r,s,t]\)-colourings of paths
- \([1,1,t]\)-colorings of complete graphs
- \([r, s, t]\)-colouring of paths, cycles and stars
- The (p,q)-total labeling problem for trees
- scientific article; zbMATH DE number 2061160 (Why is no real title available?)
- A result on \(K\)-\((2,1)\)-total choosability of planar graphs
- \([r,s,t]\)-colorings of stars
- Two results on \(k\)-\((2,1)\)-total choosability of planar graphs
- \([r, s, t; f]\)-coloring of graphs
- A note on \([r, s, c, t]\)-colorings of graphs
- On the \([r, s, t]\)-coloring of the square of cylindrical grids
- \([r,s,t]\)-colorings of graph products
- \([r,s,t]\)-chromatic numbers and hereditary properties of graphs
- \([r,s,t]\)-colorings of friendship graphs and wheels
- \([r,s,t]\)-coloring of trees and bipartite graphs
- (2,1)-total labelling of trees with sparse vertices of maximum degree
- \((2,1)\)-Total number of trees with maximum degree three
This page was built for publication: \([r,s,t]\)-colorings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q864161)
