Journal
JOURNAL OF GRAPH THEORY
Volume 90, Issue 1, Pages 54-60Publisher
WILEY
DOI: 10.1002/jgt.22367
Keywords
2-divisibility; graph coloring; perfect divisibility
Categories
Funding
- Division of Mathematical Sciences [DMS-1550991]
- Army Research Office [W911NF-16-1-0404]
- Direct For Mathematical & Physical Scien [1550991] Funding Source: National Science Foundation
Ask authors/readers for more resources
A graph G is said to be 2-divisible if for all (nonempty) induced subgraphs H of G, V(H) can be partitioned into two sets A,B such that omega(A)
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
© Peeref 2019-2024. All rights reserved.