Search results SubjectTerms:"planar subcubic graph" UL

1.	Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs Book Chapter Peer reviewed Open access	Full text PDF
2.	Star list chromatic number of planar subcubic graphs Chen, Min; Raspaud, André; Wang, Weifan Journal of combinatorial optimization, 04/2014, Volume: 27, Issue: 3 Journal Article Peer reviewed A proper coloring of the vertices of a graph G is called a star-coloring if the union of every two color classes induces a star forest. The graph G is L -star-colorable if for a given list assignment ...	Full text Available for: UL

Search results