Contents

Abstract

-

References

Journal of Combinatorial Mathematics and Combinatorial Computing

Volume 018
Pages: 186-192

Research article

Complete $(k - 1)$ -Subgraphs of $k$ -Critical Graphs

^¹

¹Department of Mathematics Wayne State University Detroit, MI 48202, USA

Published: 30/06/1995

Copyright Link
License

Abstract

A graph $G$ is called $k$ -critical if $χ (G) = k$ and $χ (G - e) k$ is at most $n - k + 3$ if $k \leq 7$ .