AbstractWe will show that Grinstead's Conjecture holds true if min(α(G),ω(G))≦8. In other words; a circular partitionable graph G satisfying min(α(G),ω(G))≦8 is always a so-called “CGPW-graph”
Hadwiger’s conjecture states that every graph with chromatic number χ has a clique minor of size χ. ...
The Erdős-Gyárfás conjecture (EGC) states that every graph with minimum vertex degree of at least 3 ...
Conjectured in 1943, Hadwiger’s conjecture is one of the most challenging open problems in graph the...
Brooks ’ Theorem implies that if a graph has ∆ ≥ 3 and and χ> ∆, then ω = ∆+1. Borodin and Kosto...
AbstractLet G be any graph and let c(G) denote the circumference of G. We conjecture that for every ...
AbstractLet R(Cn, Cp) be the smallest integer m for which the following statement is true: If a G gr...
The long-standing Erdős-Hajnal conjecture states that for every n-vertex undirected graph H there ex...
AbstractThe length of a longest cycle in a graph G is called the circumference of G and is denoted b...
The intention of this note is to motivate the researchers to study Hadwiger's conjecture for circula...
Given a graph G, the Hadwiger number of G, denoted by h(G), is the largest integer κ such that G con...
We prove that every graph G with chromatic number χ(G) = ∆(G) − 1 and ∆(G) ≥ 66 contains a clique of...
Let G=(V,E) be a countable graph. The Bunkbed graph of G is the product graph G×K2 , which has ve...
Robertson, Seymour and Thomas in a paper of 146 pages long (see [1]); in this manuscript, via an ori...
A graph is said to have property P1,n if for every sequence of n + 1 points, there is another point ...
AbstractHajós’ conjecture asserts that a simple eulerian graph on n vertices can be decomposed into ...
Hadwiger’s conjecture states that every graph with chromatic number χ has a clique minor of size χ. ...
The Erdős-Gyárfás conjecture (EGC) states that every graph with minimum vertex degree of at least 3 ...
Conjectured in 1943, Hadwiger’s conjecture is one of the most challenging open problems in graph the...
Brooks ’ Theorem implies that if a graph has ∆ ≥ 3 and and χ> ∆, then ω = ∆+1. Borodin and Kosto...
AbstractLet G be any graph and let c(G) denote the circumference of G. We conjecture that for every ...
AbstractLet R(Cn, Cp) be the smallest integer m for which the following statement is true: If a G gr...
The long-standing Erdős-Hajnal conjecture states that for every n-vertex undirected graph H there ex...
AbstractThe length of a longest cycle in a graph G is called the circumference of G and is denoted b...
The intention of this note is to motivate the researchers to study Hadwiger's conjecture for circula...
Given a graph G, the Hadwiger number of G, denoted by h(G), is the largest integer κ such that G con...
We prove that every graph G with chromatic number χ(G) = ∆(G) − 1 and ∆(G) ≥ 66 contains a clique of...
Let G=(V,E) be a countable graph. The Bunkbed graph of G is the product graph G×K2 , which has ve...
Robertson, Seymour and Thomas in a paper of 146 pages long (see [1]); in this manuscript, via an ori...
A graph is said to have property P1,n if for every sequence of n + 1 points, there is another point ...
AbstractHajós’ conjecture asserts that a simple eulerian graph on n vertices can be decomposed into ...
Hadwiger’s conjecture states that every graph with chromatic number χ has a clique minor of size χ. ...
The Erdős-Gyárfás conjecture (EGC) states that every graph with minimum vertex degree of at least 3 ...
Conjectured in 1943, Hadwiger’s conjecture is one of the most challenging open problems in graph the...
DOI
Add to ORKG