Pages that link to "Item:Q4785700"
From MaRDI portal
The following pages link to Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles (Q4785700):
Displaying 35 items.
- A sufficient condition for a planar graph to be 4-choosable (Q526822) (← links)
- A note on edge-choosability of planar graphs without intersecting 4-cycles (Q545596) (← links)
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles (Q641187) (← links)
- Planar graphs without 4-cycles adjacent to triangles are 4-choosable (Q738863) (← links)
- The 4-choosability of toroidal graphs without intersecting triangles (Q845970) (← links)
- On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability (Q854811) (← links)
- Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable (Q858302) (← links)
- On 3-choosability of planar graphs without certain cycles (Q963411) (← links)
- Edge-choosability of planar graphs without non-induced 5-cycles (Q976112) (← links)
- Edge-choosability of planar graphs without adjacent triangles or without 7-cycles (Q998494) (← links)
- Edge choosability of planar graphs without 5-cycles with a chord (Q1025481) (← links)
- On 3-choosable planar graphs of girth at least 4 (Q1025501) (← links)
- On 3-choosability of plane graphs without 6-, 7- and 9-cycles (Q1430647) (← links)
- Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable (Q1712501) (← links)
- Planar graphs without chordal 6-cycles are 4-choosable (Q1752596) (← links)
- Choosability, edge choosability and total choosability of outerplane graphs (Q1840829) (← links)
- The edge-face choosability of plane graphs (Q1883606) (← links)
- DP-4-coloring of planar graphs with some restrictions on cycles (Q1981697) (← links)
- The 4-choosability of planar graphs and cycle adjacency (Q1981715) (← links)
- Cover and variable degeneracy (Q2075519) (← links)
- Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable (Q2078245) (← links)
- On sufficient conditions for planar graphs to be 5-flexible (Q2117537) (← links)
- On \((3, r)\)-choosability of some planar graphs (Q2117577) (← links)
- Planar graphs without 7-cycles and butterflies are DP-4-colorable (Q2185894) (← links)
- Flexibility of planar graphs -- sharpening the tools to get lists of size four (Q2243143) (← links)
- List coloring and diagonal coloring for plane graphs of diameter two (Q2286099) (← links)
- DP-4-colorability of planar graphs without adjacent cycles of given length (Q2306602) (← links)
- List edge coloring of planar graphs without non-induced 6-cycles (Q2354599) (← links)
- Planar graphs without intersecting 5-cycles are 4-choosable (Q2397522) (← links)
- Bordeaux 3-color conjecture and 3-choosability (Q2488930) (← links)
- 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz (Q2685332) (← links)
- Choosability of toroidal graphs without short cycles (Q3055923) (← links)
- DP-coloring on planar graphs without given adjacent short cycles (Q5012814) (← links)
- 不含带弦6-圈和项链图的平面图是DP-4-可染的 (Q5038381) (← links)
- Variable degeneracy of planar graphs without chorded 6-cycles (Q6652636) (← links)
