The following pages link to \([r,s,t]\)-colorings of graphs (Q864161):
Displaying 16 items.
- \([1,1,t]\)-colorings of complete graphs (Q354429) (← links)
- The \((p,q)\)-total labeling problem for trees (Q408175) (← links)
- \([r,s,t]\)-colorings of graph products (Q742628) (← links)
- \([r,s,t]\)-chromatic numbers and hereditary properties of graphs (Q868364) (← links)
- \([r,s,t]\)-colorings of friendship graphs and wheels (Q897282) (← links)
- \([r,s,t]\)-coloring of trees and bipartite graphs (Q960923) (← links)
- (2,1)-total labelling of trees with sparse vertices of maximum degree (Q976073) (← links)
- \((2,1)\)-Total number of trees with maximum degree three (Q989489) (← links)
- \([r,s,t]\)-coloring of \(K_{n,n}\) (Q1034949) (← links)
- On \((d,1)\)-total numbers of graphs (Q1043541) (← links)
- \((2,1)\)-total labeling of trees with large maximum degree (Q2348054) (← links)
- A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\) (Q2359803) (← links)
- Facial \([r,s,t]\)-colorings of plane graphs (Q2416948) (← links)
- \((2,1)\)-total labelling of outerplanar graphs (Q2462398) (← links)
- (Q5081905) (← links)
- Two results on K-(2,1)-total choosability of planar graphs (Q5859491) (← links)
