Two-coloring the edges of a cubic graph such that each
                monochromatic component is a path of length at most 5

Research output: Contribution to journal › Journal article › Research › peer-review

Original language	English
Journal	Journal of Combinatorial Theory. Series B
Volume	75
Issue number	1
Pages (from-to)	100-109
ISSN	0095-8956
Publication status	Published - 1999

OpenUrl availability

@article{37d7057bdac44edd9dcfaea6efd290ec,

title = "Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5",

author = "Carsten Thomassen",

year = "1999",

language = "English",

volume = "75",

pages = "100--109",

journal = "Journal of Combinatorial Theory. Series B",

issn = "0095-8956",

publisher = "Academic Press",

number = "1",

}