Results 1  10
of
200
Contractible Cliques in kConnected Graphs
, 2005
"... Kawarabayashi proved that for any integer k ≥ 4, every kconnected graph contains two triangles sharing an edge, or admits a kcontractible edge, or admits a kcontractible triangle. This implies Thomassen’s result that every trianglefree kconnected graph contains a kcontractible edge. In this pa ..."
Abstract
 Add to MetaCart
Kawarabayashi proved that for any integer k ≥ 4, every kconnected graph contains two triangles sharing an edge, or admits a kcontractible edge, or admits a kcontractible triangle. This implies Thomassen’s result that every trianglefree kconnected graph contains a kcontractible edge
Contractible Subgraphs in kConnected Graphs
, 2006
"... For a graph G we define a graph T(G) whose vertices are the triangles in G and two vertices of T(G) are adjacent if their corresponding triangles in G share an edge. Kawarabayashi showed that if G is a kconnected graph and T(G) contains no edge then G admits a kcontractible clique of size at most ..."
Abstract
 Add to MetaCart
For a graph G we define a graph T(G) whose vertices are the triangles in G and two vertices of T(G) are adjacent if their corresponding triangles in G share an edge. Kawarabayashi showed that if G is a kconnected graph and T(G) contains no edge then G admits a kcontractible clique of size at most
Property Testing and its connection to Learning and Approximation
"... We study the question of determining whether an unknown function has a particular property or is fflfar from any function with that property. A property testing algorithm is given a sample of the value of the function on instances drawn according to some distribution, and possibly may query the fun ..."
Abstract

Cited by 475 (67 self)
 Add to MetaCart
the function on instances of its choice. First, we establish some connections between property testing and problems in learning theory. Next, we focus on testing graph properties, and devise algorithms to test whether a graph has properties such as being kcolorable or having a aeclique (clique of density ae
Note on kcontractible edges in kconnected graphs
"... It is proved that if G is a kconnected graph which does not contain K;; with k being odd, then G has an edge e such that the graph obtained from G by contracting e is still kconnected. The same conclusion does not hold when k is even. This result is a generalization of the famous theorem of Thomas ..."
Abstract
 Add to MetaCart
It is proved that if G is a kconnected graph which does not contain K;; with k being odd, then G has an edge e such that the graph obtained from G by contracting e is still kconnected. The same conclusion does not hold when k is even. This result is a generalization of the famous theorem
Cliquewidth and edge contraction
, 2013
"... We prove that edge contractions do not preserve the property that a set of graphs has bounded cliquewidth. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We prove that edge contractions do not preserve the property that a set of graphs has bounded cliquewidth.
Clique Minors In Graphs And Their Complements
, 2000
"... A graph H is a minor of a graph G if H can be obtained from a subgraph of G by contracting edges. Let t ≥ 1 be an integer, and let G be a graph on n vertices with no minor isomorphic to Kt+1. Kostochka conjectures that there exists a constant c = c(k) independent of G such that the complement of G h ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
A graph H is a minor of a graph G if H can be obtained from a subgraph of G by contracting edges. Let t ≥ 1 be an integer, and let G be a graph on n vertices with no minor isomorphic to Kt+1. Kostochka conjectures that there exists a constant c = c(k) independent of G such that the complement of G
Graphs of PowerBounded CliqueWidth
, 2014
"... Cliquewidth is a graph parameter with many algorithmic applications. For a positive integer k, the kth power of a graph G is the graph with the same vertex set as G, in which two distinct vertices are adjacent if and only if they are at distance at most k in G. Many graph algorithmic problems can ..."
Abstract
 Add to MetaCart
classes of powerunbounded cliquewidth and give a sufficient condition for cliquewidth to be powerbounded. Based on this condition, we characterize graph classes of powerbounded cliquewidth among classes defined by two connected forbidden induced subgraphs. We also show that for every integer k
CLIQUE MINORS IN CARTESIAN PRODUCTS OF GRAPHS
, 2008
"... A clique minor in a graph G can be thought of as a set of connected subgraphs in G that are pairwise disjoint and pairwise adjacent. The Hadwiger number ηÔGÕis the maximum cardinality of a clique minor in G. This paper studies clique minors in the Cartesian product G¥H. Our main result is a rough s ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
A clique minor in a graph G can be thought of as a set of connected subgraphs in G that are pairwise disjoint and pairwise adjacent. The Hadwiger number ηÔGÕis the maximum cardinality of a clique minor in G. This paper studies clique minors in the Cartesian product G¥H. Our main result is a rough
Results 1  10
of
200