OPAC (Online Public Access Catalog)
Collection Search
start it by typing one or more keywords for title, author or subject
Colouring of (P3 ∪ P2)-free graphs
BHARATHI, Arpitha P - Personal Name
CHOUDUM, · Sheshayya A - Personal Name
The class of 2K2-free graphs and its various subclasses have been studied in a variety of contexts. In this paper, we are concerned with the colouring of (P3 ∪ P2)- free graphs, a super class of 2K2-free graphs. We derive a O(ω3) upper bound for the chromatic number of(P3∪P2)-free graphs, and sharper bounds for(P3∪P2, diamond) free graphs and for (2K2, diamond)-free graphs, where ω denotes the clique number The last two classes are perfect if ω ≥ 5 and ≥ 4 respectively.
Availability
| EB00000003425K | Available |
Detail Information
Series Title
-
Call Number
-
Publisher
: ,
Collation
-
Language
ISBN/ISSN
-
Classification
NONE
Detail Information
Content Type
E-Jurnal
Media Type
-
Carrier Type
-
Edition
-
Subject(s)
Colouring
Chromatic number
Clique number
2K2-free graphs
(P3 ∪ P2)-free graphs
Diamond
Perfect graphs
Specific Detail Info
-
Statement of Responsibility
-
No other version available
File Attachment
