Premium
A Graph with cover degeneracy less than chromatic number
Author(s) -
Pyatkin A.V.
Publication year - 2001
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.1019
Subject(s) - combinatorics , mathematics , degeneracy (biology) , windmill graph , chromatic scale , partition (number theory) , friendship graph , graph , vertex (graph theory) , arboricity , discrete mathematics , graph power , line graph , planar graph , biology , bioinformatics
This note contains an example of a 4‐chromatic graph which admits a vertex partition into three parts such that the union of every two of them induces a forest. © 2001 John Wiley & Sons, Inc. J Graph Theory 37: 243–246, 2001
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom