Premium
Critically cochromatic graphs
Author(s) -
Broere Izak,
Burger Marieta
Publication year - 1989
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.3190130106
Subject(s) - combinatorics , mathematics , vertex (graph theory) , graph , discrete mathematics
A graph G is critically n ‐cochromatic if (its cochromatic number) z ( G ) = n and z ( G ‐ v ) = n ‐ 1 for every vertex v of G. Properties of critically n ‐cochromatic graphs are discussed and we also construct graphs that are critically n ‐chromatic and critically n ‐cochromatic.
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