Pages that link to "Item:Q3648509"
From MaRDI portal
The following pages link to Total-Coloring of Plane Graphs with Maximum Degree Nine (Q3648509):
Displayed 46 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 the minimum total coloring of planar graphs (Q326982) (← 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)
- A note on the total coloring of planar graphs without adjacent 4-cycles (Q427837) (← links)
- Total colorings of planar graphs without intersecting 5-cycles (Q444447) (← links)
- Minimum total coloring of planar graph (Q475814) (← links)
- Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic (Q476647) (← links)
- Total coloring of planar graphs without chordal short cycles (Q497376) (← links)
- Total coloring of planar graphs without adjacent short cycles (Q512886) (← links)
- On \((p,1)\)-total labelling of planar graphs (Q512891) (← 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 colorings of planar graphs with maximum degree seven and without intersecting 3-cycles (Q641163) (← links)
- Entire colouring of plane graphs (Q651038) (← links)
- On \((p,1)\)-total labelling of 1-planar graphs (Q651281) (← links)
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable (Q708386) (← links)
- Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable (Q967320) (← links)
- Total coloring of planar graphs of maximum degree eight (Q991795) (← links)
- On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles (Q1033023) (← links)
- Total colorings of planar graphs with maximum degree at least 8 (Q1043002) (← links)
- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles (Q1043815) (← links)
- Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles (Q1656911) (← 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)
- Total coloring of recursive maximal planar graphs (Q2078611) (← links)
- The total coloring of \(K_5\)-minor-free graphs (Q2122692) (← links)
- Total coloring of claw-free planar graphs (Q2151210) (← links)
- A sufficient condition for planar graphs of maximum degree 6 to be totally 7-colorable (Q2183240) (← links)
- On \((p, 1)\)-total labelling of some 1-planar graphs (Q2227112) (← links)
- Total coloring of planar graphs without some chordal 6-cycles (Q2340805) (← links)
- Total coloring of planar graphs without adjacent chordal 6-cycles (Q2410046) (← links)
- Total colorings of planar graphs with sparse triangles (Q2437770) (← links)
- Total colorings of planar graphs without chordal 6-cycles (Q2449112) (← links)
- A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable (Q2453854) (← links)
- Minimum total coloring of planar graphs with maximum degree 8 (Q2698022) (← links)
- Edge-face coloring of plane graphs with maximum degree nine (Q3168662) (← links)
- Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable (Q6047966) (← links)
- Total coloring of planar graphs without some adjacent cycles (Q6111630) (← links)
- Total colorings-a survey (Q6152623) (← links)