-colorings and -bipartite graphs.
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] (2001)
- Volume: 4, Issue: 2, page 109-122
- ISSN: 1365-8050
Access Full Article
topHow to cite
topHoang, C.T., and Le, V.B.. "-colorings and -bipartite graphs.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 4.2 (2001): 109-122. <http://eudml.org/doc/121091>.
@article{Hoang2001,
	author = {Hoang, C.T., Le, V.B.},
	journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
	keywords = {partition; coloring; NP-complete; color class; strong perfect graph conjecture},
	language = {eng},
	number = {2},
	pages = {109-122},
	publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},
	title = {-colorings and -bipartite graphs.},
	url = {http://eudml.org/doc/121091},
	volume = {4},
	year = {2001},
}
TY  - JOUR
AU  - Hoang, C.T.
AU  - Le, V.B.
TI  - -colorings and -bipartite graphs.
JO  - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
PY  - 2001
PB  - Maison de l'Informatique et des Mathématiques Discrètes, MIMD
VL  - 4
IS  - 2
SP  - 109
EP  - 122
LA  - eng
KW  - partition; coloring; NP-complete; color class; strong perfect graph conjecture
UR  - http://eudml.org/doc/121091
ER  - 
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.
 
 