List point arboricity of graphs
From MaRDI portal
Recommendations
Cites work
- Choosability and edge choosability of planar graphs without five cycles
- Covering and packing in graphs IV: Linear arboricity
- COVERING AND PACKING IN GRAPHS, I.
- Graph colorings with local constraints -- a survey
- Graph theory with applications
- List point arboricity of dense graphs
- On Complementary Graphs
- On the Point-Arboricity of a Graph and its Complement
- On the vertex-arboricity of planar graphs
- Planar graphs without cycles of specific lengths
- The point-arboricity of a graph
- Topology of series-parallel networks
- Variable degeneracy: Extensions of Brooks' and Gallai's theorems
Cited in
(14)- List point arboricity of dense graphs
- A note on list arboricity
- An analogue of DP-coloring for variable degeneracy and its applications
- Cover and variable degeneracy
- A generalization of some results on list coloring and DP-coloring
- On the critical point-arboricity graphs
- The list point arboricity of some complete multi-partite graphs.
- scientific article; zbMATH DE number 5846193 (Why is no real title available?)
- scientific article; zbMATH DE number 1135686 (Why is no real title available?)
- A weaker version of a conjecture on list vertex arboricity of graphs
- Equitable list point arboricity of graphs
- The list linear arboricity of graphs
- Signed colouring and list colouring of k‐chromatic graphs
- List total arboricity of 2-degenerate graphs
This page was built for publication: List point arboricity of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3166733)