Pages that link to "Item:Q1609512"
From MaRDI portal
The following pages link to Choosability and edge choosability of planar graphs without five cycles (Q1609512):
Displaying 50 items.
- Acyclic edge coloring of planar graphs without 5-cycles (Q423934) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- 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)
- Planar graphs without cycles of specific lengths (Q697075) (← links)
- Planar graphs without 4-cycles adjacent to triangles are 4-choosable (Q738863) (← links)
- On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability (Q854811) (← links)
- Choosability in signed planar graphs (Q896077) (← links)
- Equitable list colorings of planar graphs without short cycles (Q954980) (← links)
- On 3-choosability of planar graphs without certain cycles (Q963411) (← links)
- Edge-choosability of planar graphs without non-induced 5-cycles (Q976112) (← links)
- Structural properties and edge choosability of planar graphs without 4-cycles (Q998462) (← 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)
- Vertex arboricity of planar graphs without intersecting 5-cycles (Q1702820) (← links)
- List-edge-coloring of planar graphs without 6-cycles with three chords (Q1702837) (← links)
- Planar graphs without chordal 6-cycles are 4-choosable (Q1752596) (← links)
- A sufficient condition for DP-4-colorability (Q1752670) (← links)
- Edge choosability of planar graphs without small cycles (Q1827800) (← links)
- Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate (Q1981692) (← links)
- The 4-choosability of planar graphs and cycle adjacency (Q1981715) (← links)
- Planar graphs without specific cycles are 2-degenerate (Q2037563) (← links)
- Cycle spectra of contraction-critically 4-connected planar graphs (Q2053680) (← links)
- Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable (Q2078245) (← links)
- On weak flexibility in planar graphs (Q2093108) (← links)
- Distribution of subtree sums (Q2107487) (← links)
- Two sufficient conditions for a planar graph to be list vertex-2-arborable (Q2124649) (← links)
- Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate (Q2144489) (← links)
- Planar graphs without 7-cycles and butterflies are DP-4-colorable (Q2185894) (← links)
- On-line DP-coloring of graphs (Q2197455) (← links)
- List edge coloring of planar graphs without 6-cycles with two chords (Q2214317) (← links)
- A note on edge-group choosability of planar graphs without 5-cycles (Q2221861) (← 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 two classes of planar graphs (Q2324485) (← links)
- Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles (Q2345542) (← links)
- List edge coloring of planar graphs without non-induced 6-cycles (Q2354599) (← links)
- On group choosability of total graphs (Q2376095) (← links)
- Planar graphs without intersecting 5-cycles are 4-choosable (Q2397522) (← links)
- \((4,2)\)-choosability of planar graphs with forbidden structures (Q2409516) (← links)
- On the vertex-arboricity of planar graphs (Q2427551) (← links)
- Bordeaux 3-color conjecture and 3-choosability (Q2488930) (← links)
- Some sufficient conditions for a planar graph of maximum degree six to be Class 1 (Q2497482) (← links)
- Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles (Q2680856) (← links)
- 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz (Q2685332) (← links)
- Vertex arboricity of planar graphs without chordal 6-cycles (Q2868169) (← links)
- Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable (Q2947439) (← links)
- Choosability of toroidal graphs without short cycles (Q3055923) (← links)
- LIST POINT ARBORICITY OF GRAPHS (Q3166733) (← links)
- EQUITABLE COLORING OF 2-DEGENERATE GRAPH AND PLANE GRAPHS WITHOUT CYCLES OF SPECIFIC LENGTHS (Q3575377) (← links)
