Pages that link to "Item:Q1356668"
From MaRDI portal
The following pages link to The total chromatic number of any multigraph with maximum degree five is at most seven (Q1356668):
Displaying 50 items.
- Total coloring of planar graphs without chordal 7-cycles (Q272520) (← links)
- Total coloring of planar graphs without short cycles (Q281812) (← links)
- A note on total and list edge-colouring of graphs of tree-width 3 (Q293637) (← links)
- A note on the minimum total coloring of planar graphs (Q326982) (← links)
- Total coloring of certain classes of product graphs (Q327644) (← links)
- Total coloring of planar graphs with 7-cycles containing at most two chords (Q391771) (← links)
- Total coloring of embedded graphs with maximum degree at least seven (Q391777) (← links)
- Total coloring of planar graphs with maximum degree 8 (Q393898) (← links)
- Total colorings of \(F_5\)-free planar graphs with maximum degree 8 (Q405156) (← 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)
- A note on the total coloring of planar graphs without adjacent 4-cycles (Q427837) (← links)
- (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles (Q432709) (← links)
- The total chromatic number of split-indifference graphs (Q442393) (← links)
- Total colorings of planar graphs without intersecting 5-cycles (Q444447) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Minimum total coloring of planar graph (Q475814) (← links)
- Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic (Q476647) (← links)
- Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs (Q496654) (← links)
- Total coloring of planar graphs without chordal short cycles (Q497376) (← links)
- Total coloring of planar graphs without adjacent short cycles (Q512886) (← links)
- A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five (Q520529) (← links)
- Local condition for planar graphs of maximum degree 7 to be 8-totally colorable (Q534337) (← 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 colorings of planar graphs with maximum degree seven and without intersecting 3-cycles (Q641163) (← links)
- Total chromatic number of unichord-free graphs (Q643026) (← links)
- Entire colouring of plane graphs (Q651038) (← links)
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable (Q708386) (← links)
- A larger family of planar graphs that satisfy the total coloring conjecture (Q742577) (← links)
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8 (Q785813) (← links)
- \([r,s,t]\)-colorings of graphs (Q864161) (← links)
- \([r,s,t]\)-chromatic numbers and hereditary properties of graphs (Q868364) (← links)
- Facial entire colouring of plane graphs (Q898120) (← links)
- Total colorings of planar graphs without small cycles (Q937252) (← links)
- Total and fractional total colourings of circulant graphs (Q998370) (← links)
- Total colorings of planar graphs without adjacent triangles (Q998509) (← links)
- On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles (Q1033023) (← links)
- The total chromatic number of regular graphs of high degree (Q1042999) (← links)
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles (Q1045095) (← links)
- List edge and list total colourings of multigraphs (Q1366604) (← links)
- The total chromatic number of graphs of even order and high degree (Q1408886) (← links)
- Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles (Q1656911) (← links)
- The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven (Q1698052) (← links)
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 (Q1732773) (← links)
- Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable (Q1934390) (← 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)
- Total coloring of planar graphs with maximum degree \(7\) (Q1944191) (← links)
- A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable (Q2030446) (← links)
