Author:
Bazgan Cristina,Nichterlein André,Vazquez Alferez Sofia
Reference37 articles.
1. Graphs with maximum degree ? ? 17 and maximum average degree less than 3 are list 2-distance (? + 2)-colorable;Marthe Bonamy;Discrete Mathematics,2014
2. On 1improper 2-coloring of sparse graphs;Oleg V Borodin;Discrete Mathematics,2013
3. Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1;Oleg V Borodin;Siberian Mathematical Journal,2011
4. Feedback vertex set on hamiltonian graphs;Dario Cavallaro;47th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2021)