Paper Info
Title
A Relaxed Version of the Erdős-Lovász Tihany Conjecture.
Abstract
The Erds-Lovasz Tihany conjecture asserts that every graph G with (G)<(G)=s+t-1 (s,t2) contains two vertex disjoint subgraphs G(1) and G(2) such that (G1)s and (G2)t. Under the same assumption on G, we show that there are two vertex disjoint subgraphs G(1) and G(2) of G such that (a) (G1)s and col (G2)t or (b) col (G1)s and (G2)t. Here, (G) is the chromatic number of G,(G) is the clique number of G, and col(G) is the coloring number of G. (C) 2016 Wiley Periodicals, Inc.
Year
DOI
Venue
2017
10.1002/jgt.22060
JOURNAL OF GRAPH THEORY
Keywords
Field
DocType
coloring,decomposition,double-critical graphs
Discrete mathematics,Complete coloring,Topology,Combinatorics,Conjecture,Mathematics
Journal
Volume
Issue
ISSN
85.0
1.0
0364-9024
Citations 
PageRank 
References 
3
0.49
7
Authors
1
Name
Order
Citations
PageRank
Michael Stiebitz120730.08