Premium
Note on Choudum's “chromatic bounds for a class of graphs”
Author(s) -
Javdekar Medha
Publication year - 1980
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.3190040303
Subject(s) - combinatorics , mathematics , chromatic scale , graph , discrete mathematics , clique number
If a graph G has no induced subgraph isomorphic to K 1,3′ K 5 ‐ e , or a third graph that can be selected from two specific graphs, then the chromatic number of G is either d or d + 1, where d is the maximum order of a clique in G .
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