Pages that link to "Item:Q3122897"
From MaRDI portal
The following pages link to On 3-colorable non-4-choosable planar graphs (Q3122897):
Displaying 20 items.
- Multiple list colouring of planar graphs (Q345127) (← links)
- List coloring of planar graphs with forbidden cycles (Q510959) (← links)
- List precoloring extension in planar graphs (Q536235) (← links)
- A counterexample to the conjecture of Aksionov and Mel'nikov on non-3- colorable planar graphs (Q793751) (← links)
- A note on the not 3-choosability of some families of planar graphs (Q845679) (← links)
- Choosability in signed planar graphs (Q896077) (← links)
- A simple algorithm for 4-coloring 3-colorable planar graphs (Q974757) (← links)
- The 4-choosability of plane graphs without 4-cycles (Q1305526) (← links)
- On 3-choosability of plane graphs without 6-, 7- and 9-cycles (Q1430647) (← links)
- A note on not-4-list colorable planar graphs (Q1640221) (← links)
- Smaller planar triangle-free graphs that are not 3-list-colorable (Q1772422) (← links)
- On structure of some plane graphs with application to choosability (Q1850547) (← links)
- A not 3-choosable planar graph without 3-cycles (Q1903746) (← links)
- DP-4-coloring of planar graphs with some restrictions on cycles (Q1981697) (← links)
- The choice number versus the chromatic number for graphs embeddable on orientable surfaces (Q2121742) (← links)
- Facial list colourings of plane graphs (Q2629297) (← links)
- On Non 3-Choosable Bipartite Graphs (Q2864326) (← links)
- (Q5492576) (← links)
- The Alon-Tarsi number of two kinds of planar graphs (Q6164660) (← links)
- On two problems of defective choosability of graphs (Q6657596) (← links)
