Pages that link to "Item:Q4823300"
From MaRDI portal
The following pages link to A note on total colorings of planar graphs without 4-cycles (Q4823300):
Displaying 29 items.
- Total coloring of planar graphs without chordal 7-cycles (Q272520) (← links)
- Hamiltonicity and generalised total colourings of planar graphs (Q274671) (← links)
- Total coloring of planar graphs without short cycles (Q281812) (← links)
- Total colorings of planar graphs with small maximum degree (Q360968) (← links)
- \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles (Q407567) (← 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)
- Total colorings of planar graphs without intersecting 5-cycles (Q444447) (← links)
- Acyclic total colorings of planar graphs without \(l\) cycles (Q475741) (← links)
- Total coloring of planar graphs without 6-cycles (Q617651) (← 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)
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles (Q641187) (← links)
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable (Q708386) (← links)
- A note on complex-4-colorability of signed planar graphs (Q831346) (← links)
- List edge and list total colorings of planar graphs without 4-cycles (Q861265) (← links)
- Total colorings of planar graphs without small cycles (Q937252) (← links)
- Total colorings of planar graphs without adjacent triangles (Q998509) (← links)
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles (Q1045095) (← 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 planar graphs with maximum degree \(7\) (Q1944191) (← links)
- Total coloring of claw-free planar graphs (Q2151210) (← links)
- Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph (Q2274084) (← links)
- On total chromatic number of planar graphs without 4-cycles (Q2372576) (← links)
- Total coloring of planar graphs without adjacent chordal 6-cycles (Q2410046) (← links)
- Total colorings of planar graphs without chordal 6-cycles (Q2449112) (← links)
- (Q3611310) (← links)
- (Q4625641) (← links)
