Pages that link to "Item:Q708400"
From MaRDI portal
The following pages link to Acyclic 3-choosability of sparse graphs with girth at least 7 (Q708400):
Displaying 15 items.
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Acyclic 4-choosability of planar graphs (Q616366) (← links)
- A note on the acyclic 3-choosability of some planar graphs (Q708344) (← links)
- Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles (Q710596) (← links)
- Acyclic 4-choosability of planar graphs without adjacent short cycles (Q713156) (← links)
- On acyclic 4-choosability of planar graphs without short cycles (Q982617) (← links)
- Planar graphs without 4- and 5-cycles are acyclically 4-choosable (Q1949098) (← links)
- Acyclic 6-choosability of planar graphs without 5-cycles and adjacent 4-cycles (Q2042281) (← links)
- Parallelization strategies for computational fluid dynamics software: state of the art review (Q2359618) (← links)
- List strong linear 2-arboricity of sparse graphs (Q3005110) (← links)
- Acyclic 5-choosability of planar graphs without adjacent short cycles (Q3174245) (← links)
- Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles (Q4916098) (← links)
- Improper choosability of graphs and maximum average degree (Q5486272) (← links)
- Acyclic 5-choosability of planar graphs without 4-cycles (Q5894310) (← links)
- Hardness transitions and uniqueness of acyclic colouring (Q6145810) (← links)
