The following pages link to (Q3815316):
Displaying 40 items.
- Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs (Q496654) (← links)
- On the chromatic number of Toeplitz graphs (Q496679) (← links)
- The sigma chromatic number of a graph (Q607685) (← links)
- Total chromatic number of unichord-free graphs (Q643026) (← links)
- Recent results on the total chromatic number (Q686483) (← links)
- \(D(\beta)\)-vertex-distinguishing total coloring of graphs (Q867795) (← links)
- The total chromatic number of complete multipartite graphs with low deficiency (Q897273) (← links)
- Equitable total coloring of \(F_n \vee W_n\) (Q1036897) (← links)
- Adjacent strong edge colorings and total colorings of regular graphs (Q1041555) (← links)
- Chromatic number of finite and infinite graphs and hypergraphs (Q1059084) (← links)
- A bound on the total chromatic number (Q1297726) (← links)
- Relaxed chromatic numbers of graphs (Q1323496) (← links)
- The total chromatic number of pseudo-outerplanar graphs (Q1377186) (← links)
- Total coloring of outer-1-planar graphs with near-independent crossings (Q1680477) (← links)
- Rank, term rank and chromatic number of a graph (Q1764180) (← links)
- Choosability, edge choosability and total choosability of outerplane graphs (Q1840829) (← links)
- On the colorings of outerplanar graphs (Q1910522) (← links)
- Total coloring of outer-1-planar graphs: the cold case (Q2039699) (← links)
- Total difference chromatic numbers of graphs (Q2192426) (← links)
- The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\) (Q2494102) (← links)
- The complete chromatic number of some planar graphs (Q2715347) (← links)
- Finding the chromatic number by means of critical graphs (Q2816102) (← links)
- Total chromatic number of \{square,unichord\}-free graphs (Q2883635) (← links)
- (Q2993903) (← links)
- (Q2994411) (← links)
- (Q3119321) (← links)
- The total chromatic number of some bipartite graphs (Q3439400) (← links)
- (Q3737452) (← links)
- (Q3818330) (← links)
- (Q3841345) (← links)
- (Q3984519) (← links)
- (Q4346810) (← links)
- (Q4379734) (← links)
- (Q4470343) (← links)
- (Q4697576) (← links)
- Total Chromatic Number of Graphs of Order 2<i>n</i> + l having Maximum Degree 2<i>n</i> − 1 (Q4894516) (← links)
- Equitable total chromatic number of splitting graph (Q5142098) (← links)
- (Q5309532) (← links)
- Chromatic numbers in some graphs (Q5429791) (← links)
- On the edge-binding number of some plane graphs (Q5957977) (← links)
