Back to Search
Start Over
Well-hued graphs.
- Source :
-
Discrete Applied Mathematics . Oct2022, Vol. 320, p370-380. 11p. - Publication Year :
- 2022
-
Abstract
- We define a graph G as well-hued if for each positive integer k there is an integer a k such that every maximal k -colorable subgraph of G has order a k. This strengthens the notion of well-covered graphs. In this paper we investigate the connection between this property and related properties, characterize the sequences of the a k that can be achieved, and determine conditions for the property in some graph classes and under some graph operations such as products. [ABSTRACT FROM AUTHOR]
- Subjects :
- *INTEGERS
*CHARTS, diagrams, etc.
Subjects
Details
- Language :
- English
- ISSN :
- 0166218X
- Volume :
- 320
- Database :
- Academic Search Index
- Journal :
- Discrete Applied Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 158671971
- Full Text :
- https://doi.org/10.1016/j.dam.2022.06.010