The following pages link to Total colourings of graphs (Q1910691):
Displaying 50 items.
- Total coloring of planar graphs without chordal 7-cycles (Q272520) (← links)
- The tournament scheduling problem with absences (Q323410) (← links)
- A note on the minimum total coloring of planar graphs (Q326982) (← links)
- Edge-colouring and total-colouring chordless graphs (Q389214) (← links)
- \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles (Q407567) (← links)
- On the total choosability of planar graphs and of sparse graphs (Q407575) (← links)
- Coloring Hanoi and Sierpiński graphs (Q411656) (← links)
- (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles (Q432709) (← links)
- Total colorings of planar graphs without intersecting 5-cycles (Q444447) (← links)
- \(L(2,1)\)-labelings of subdivisions of graphs (Q472974) (← links)
- Acyclic total colorings of planar graphs without \(l\) cycles (Q475741) (← links)
- Minimum total coloring of planar graph (Q475814) (← links)
- Total coloring of planar graphs without chordal short cycles (Q497376) (← links)
- Total coloring of planar graphs without adjacent short cycles (Q512886) (← links)
- AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\) (Q516897) (← links)
- Total coloring of planar graphs without 6-cycles (Q617651) (← links)
- Total choosability of planar graphs with maximum degree 4 (Q617905) (← links)
- Total coloring of embedded graphs of maximum degree at least ten (Q625795) (← links)
- Total chromatic number of unichord-free graphs (Q643026) (← links)
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable (Q708386) (← links)
- Some colouring problems for Paley graphs (Q817760) (← links)
- \([r,s,t]\)-colorings of graphs (Q864161) (← links)
- \([r,s,t]\)-chromatic numbers and hereditary properties of graphs (Q868364) (← links)
- A result on the total colouring of powers of cycles (Q875593) (← links)
- On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\) (Q932658) (← links)
- On total chromatic number of direct product graphs (Q980443) (← links)
- Total and fractional total colourings of circulant graphs (Q998370) (← links)
- Total colorings of planar graphs without adjacent triangles (Q998509) (← links)
- Vertex-, edge-, and total-colorings of Sierpiński-like graphs (Q1024467) (← links)
- On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles (Q1033023) (← links)
- \([r,s,t]\)-coloring of \(K_{n,n}\) (Q1034949) (← links)
- The total chromatic number of regular graphs of high degree (Q1042999) (← links)
- On \((d,1)\)-total numbers of graphs (Q1043541) (← links)
- Total colorings of equibipartite graphs (Q1297471) (← links)
- Total chromatic number of graphs of odd order and high degree (Q1301827) (← links)
- The total chromatic number of pseudo-outerplanar graphs (Q1377186) (← links)
- The total chromatic number of graphs of even order and high degree (Q1408886) (← links)
- Behzad-Vizing conjecture and Cartesian-product graphs (Q1614125) (← links)
- Total coloring of rooted path graphs (Q1708273) (← links)
- Total colorings of product graphs (Q1743686) (← links)
- Entire coloring of graphs embedded in a surface of nonnegative characteristic (Q1756114) (← links)
- List total colorings of series-parallel graphs (Q1775015) (← links)
- \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle (Q1944131) (← links)
- Compositions, decompositions, and conformability for total coloring on power of cycle graphs (Q2091818) (← links)
- The total coloring of \(K_5\)-minor-free graphs (Q2122692) (← links)
- Even-power of cycles with many vertices are type 1 total colorable (Q2132416) (← links)
- Total coloring of claw-free planar graphs (Q2151210) (← links)
- On total coloring of some classes of regular graphs (Q2167796) (← links)
- Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
- The undirected optical indices of complete \(m\)-ary trees (Q2197416) (← links)
