Pages that link to "Item:Q1259607"
From MaRDI portal
The following pages link to The total coloring of a multigraph with maximal degree 4 (Q1259607):
Displaying 41 items.
- Total coloring of certain classes of product graphs (Q327644) (← links)
- Total coloring of embedded graphs with maximum degree at least seven (Q391777) (← 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)
- (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles (Q432709) (← 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)
- 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 chromatic number of unichord-free graphs (Q643026) (← links)
- The total chromatic number of graphs having large maximum degree (Q686156) (← links)
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable (Q708386) (← links)
- On topological relaxations of chromatic conjectures (Q710730) (← links)
- A larger family of planar graphs that satisfy the total coloring conjecture (Q742577) (← links)
- Total colorings of planar graphs without small cycles (Q937252) (← links)
- Total colorings of planar graphs without adjacent triangles (Q998509) (← links)
- Equitable total coloring of \(C_m\square C_n\) (Q1028450) (← 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 of graphs of order \(2n\) having maximum degree \(2n-2\) (Q1196563) (← links)
- The total chromatic number of regular graphs whose complement is bipartite (Q1318798) (← links)
- The total chromatic number of any multigraph with maximum degree five is at most seven (Q1356668) (← links)
- List edge and list total colourings of multigraphs (Q1366604) (← links)
- Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles (Q1656911) (← 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 outer-1-planar graphs: the cold case (Q2039699) (← links)
- Total coloring of recursive maximal planar graphs (Q2078611) (← links)
- Total coloring of claw-free planar graphs (Q2151210) (← links)
- Total-coloring of sparse graphs with maximum degree 6 (Q2240657) (← links)
- An upper bound for the total chromatic number (Q2277479) (← links)
- On the total-neighbor-distinguishing index by sums (Q2345540) (← links)
- On total colorings of 1-planar graphs (Q2352360) (← links)
- Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles (Q2359808) (← links)
- On total chromatic number of planar graphs without 4-cycles (Q2372576) (← links)
- On total colorings of some special 1-planar graphs (Q2401770) (← links)
- On total coloring the direct product of cycles and bipartite direct product of graphs (Q2699911) (← links)
- Total chromatic number of {square,unichord}-free graphs (Q2883635) (← links)
- On the AVDTC of Sierpiński-type graphs (Q6153464) (← links)
- Total coloring conjecture on certain classes of product graphs (Q6164667) (← links)
