|
Chromatic uniqueness of graphs that are homeomorphic to $K_4$
V. L. Mironov
Abstract:
We give a description of all chromatically unique graphs being homeomorphic to
$K_4$ which can be derived from the complete graph with four vertices by sequential
dividing only three edges. As a corollary we solve two problems stated in [4].
Received: 09.06.1993
Citation:
V. L. Mironov, “Chromatic uniqueness of graphs that are homeomorphic to $K_4$”, Diskr. Mat., 7:4 (1995), 126–135; Discrete Math. Appl., 5:6 (1995), 525–534
Linking options:
https://www.mathnet.ru/eng/dm607 https://www.mathnet.ru/eng/dm/v7/i4/p126
|
| Statistics & downloads: |
| Abstract page: | 291 | | Full-text PDF : | 132 | | References: | 2 | | First page: | 1 |
|