Pages that link to "Item:Q3008018"
From MaRDI portal
The following pages link to 3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles (Q3008018):
Displaying 10 items.
- 3-list-coloring planar graphs of girth 4 (Q626855) (← links)
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles (Q641187) (← links)
- DP-3-coloring of planar graphs without certain cycles (Q2022504) (← links)
- Planar graphs without normally adjacent short cycles (Q2144582) (← links)
- Facial unique-maximum colorings of plane graphs with restriction on big vertices (Q2312801) (← links)
- Fine Structure of 4-Critical Triangle-Free Graphs I. Planar Graphs with Two Triangles and 3-Colorability of Chains (Q3177443) (← links)
- (Q3180354) (← links)
- Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count (Q4625139) (← links)
- Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs (Q4961756) (← links)
- Improper choosability of graphs and maximum average degree (Q5486272) (← links)