Results 1  10
of
850,292
Coloring clawfree graphs with ∆ − 1 colors
, 2012
"... We prove that every clawfree graph G that doesn’t contain a clique on ∆(G) ≥ 9 vertices can be ∆(G) − 1 colored. ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
We prove that every clawfree graph G that doesn’t contain a clique on ∆(G) ≥ 9 vertices can be ∆(G) − 1 colored.
Coloring clawfree graphs with ∆ − 1 colors
, 2012
"... We prove that every clawfree graph G that doesn’t contain a clique on ∆(G) ≥ 9 vertices can be ∆(G) − 1 colored. 1 ..."
Abstract
 Add to MetaCart
We prove that every clawfree graph G that doesn’t contain a clique on ∆(G) ≥ 9 vertices can be ∆(G) − 1 colored. 1
ClawFree Graphs  a Survey.
, 1996
"... In this paper we summarize known results on clawfree graphs. The paper is subdivided into the following chapters and sections: 1. Introduction 2. Paths, cycles, hamiltonicity a) Preliminaries b) Degree and neighborhood conditions c) Local connectivity conditions d) Further forbidden subgraph ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
In this paper we summarize known results on clawfree graphs. The paper is subdivided into the following chapters and sections: 1. Introduction 2. Paths, cycles, hamiltonicity a) Preliminaries b) Degree and neighborhood conditions c) Local connectivity conditions d) Further forbidden
Clique minors in clawfree graphs
 J. Combin. Theory Ser. B
"... Hadwiger’s conjecture states that every graph with chromatic number χ has a clique minor of size χ. Let G be a graph on n vertices with chromatic number χ and stability number α. Then since χα ≥ n, Hadwiger’s conjecture implies that G has a clique minor of size n α. In this paper we prove that this ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
that this is true for connected clawfree graphs with α ≥ 3. We also show that this result is tight by providing an infinite family of clawfree graphs with α ≥ 3 that do not have a clique minor of size larger than n α
On Factors of 4Connected ClawFree Graphs
 J. GRAPH THEORY
, 1999
"... We consider the existence of several different kinds of factors in 4connected clawfree graphs. This is motivated by the following two conjectures which are in fact equivalent by a recent result of the third author. Conjecture 1 (Thomassen): Every 4connected line graph is hamiltonian, i.e. has ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
We consider the existence of several different kinds of factors in 4connected clawfree graphs. This is motivated by the following two conjectures which are in fact equivalent by a recent result of the third author. Conjecture 1 (Thomassen): Every 4connected line graph is hamiltonian, i.e. has
Reconfiguring independent sets in clawfree graphs
, 2014
"... Abstract. We present a polynomialtime algorithm that, given two independent sets in a clawfree graph G, decides whether one can be transformed into the other by a sequence of elementary steps. Each elementary step is to remove a vertex v from the current independent set S and to add a new vertex w ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
Abstract. We present a polynomialtime algorithm that, given two independent sets in a clawfree graph G, decides whether one can be transformed into the other by a sequence of elementary steps. Each elementary step is to remove a vertex v from the current independent set S and to add a new vertex
Clawfree circularperfect graphs
 EUROCOMB07 EUROPEAN CONFERENCE ON COMBINATORICS, GRAPH THEORY AND APPLICATIONS, ESPAGNE
, 2007
"... The circular chromatic number of a graph is a wellstudied refinement of the chromatic number. Circularperfect graphs is a superclass of perfect graphs defined by means of this more general coloring concept. This paper studies clawfree circularperfect graphs. A consequence of the strong perfect g ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
The circular chromatic number of a graph is a wellstudied refinement of the chromatic number. Circularperfect graphs is a superclass of perfect graphs defined by means of this more general coloring concept. This paper studies clawfree circularperfect graphs. A consequence of the strong perfect
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices
Results 1  10
of
850,292