The forest plus stars colouring problem

DOI10.1016/0012-365X(94)90282-8MaRDI QIDQ1318828zbMATH OpenOpenAlexFDO

Authors Michael Stiebitz

Publication date 4 April 1994

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(94)90282-8

zbMATH Keywords

forest plus stars colouring problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Review text

The author shows that every graph which is the union of a forest and a forest not containing a path of length three as a subgraph is 3- colorable.

Cited in

(3)

• Spanning trees with pairwise nonadjacent endvertices
• Simultaneous graph parameters: factor domination and factor total domination
• Brooks' Theorem and Beyond

This page was built for publication: The forest plus stars colouring problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1318828)