Searching for "k-Colorability of P5-free graphs" – sorted by Relevance.
-
A note on k-colorability of P5-free graphs
- A note on k-colorability of P5-free graphs Chính T. Hoàng ∗ Marcin Kamiński † Vadim Lozin ‡ J
- Add To MetaCart
-
Precoloring Extension. Ii. Graphs Classes Related To Bipartite Graphs
- several points of view. Lemma 3.5. If G = (V; E) is a reduced, partially k-colored connected graph
- Cited by 7 (0 self) – Add To MetaCart
-
Acta Math. Univ. Comenianae Vol. LXII, 1(1993), pp. 1--11
- the theorem. By the previous proof it also follows that any reduced, partially k-colored, P 5 -free graph
- Add To MetaCart

