ON GRAPHS G FOR WHICH BOTH G AND G ARE CLAW-FREE
Pełen tekst
Powiązane dokumenty
It was shown in [6] and [9] that these results can be slightly strengthened under an additional assumption that G is not hamiltonian, and this result was used to obtain
So, the following theorem extends the Krengel–Lin decomposition which is discussed in [KL] only for compact groups..
We also show that the List Coloring Conjecture holds for a planar graph that contains no kites and has ∆ ≥ 9.. In Section 5 we prove results about list total coloring, which we
If {0, 4} is blue, then by using similar methods to those in Case 1, we immediately obtain a contradiction.. But this coloring forces a red K 4 on the set {x, y, z, 2},
3, 2} is the set of all real num- bers ` such that the following holds: every tree having an eigenvalue which is larger than ` has a subtree whose largest eigenvalue is `..
We prove that all known families of projective graphs contain only strongly projective graphs, including complete graphs, odd cycles, Kneser graphs and non-bipartite
In this paper, we show that if G is 2-connected, we may just use Euler’s formula and the graph’s structural properties to prove these results.. In Section 2 we provide some lemmata,
Obviously every graph consisting of isolated vertices (regular graph of degree 0) is Simp-fixed and also the empty graph (in which both the vertex set and the edge set are empty)