Pages that link to "Item:Q641163"
From MaRDI portal
The following pages link to Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles (Q641163):
Displaying 16 items.
- Total coloring of planar graphs without chordal 7-cycles (Q272520) (← links)
- Total colorings of \(F_5\)-free planar graphs with maximum degree 8 (Q405156) (← 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)
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable (Q708386) (← links)
- On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles (Q1033023) (← links)
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles (Q1045095) (← links)
- Three-coloring and list three-coloring of graphs without induced paths on seven vertices (Q1786047) (← links)
- List total colorings of planar graphs without triangles at small distance (Q1942193) (← links)
- Total coloring of planar graphs with maximum degree \(7\) (Q1944191) (← links)
- Total coloring of claw-free planar graphs (Q2151210) (← links)
- A matrix approach to hypergraph stable set and coloring problems with its application to storing problem (Q2336703) (← 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)
- (Q5368223) (← links)
