Results 1  10
of
362,178
On the Evolution of TriangleFree Graphs
, 1999
"... Denote by T (n; m) the class of all trianglefree graphs on n vertices and m edges. Our main result is the following sharp threshold, which answers the question for which densities a typical trianglefree graph is bipartite. Fix " > 0 and let t 3 = t 3 (n) = ( 3 16 n 3 log n) 1=2 . ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Denote by T (n; m) the class of all trianglefree graphs on n vertices and m edges. Our main result is the following sharp threshold, which answers the question for which densities a typical trianglefree graph is bipartite. Fix " > 0 and let t 3 = t 3 (n) = ( 3 16 n 3 log n) 1
The independent domination number of maximal trianglefree graphs
, 2008
"... A trianglefree graph is maximal if the addition of any edge produces a triangle. A set S of vertices in a graph G is called an independent dominating set if S is both an independent and a dominating set of G. The independent domination number i(G) of G is the minimum cardinality of an independent d ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A trianglefree graph is maximal if the addition of any edge produces a triangle. A set S of vertices in a graph G is called an independent dominating set if S is both an independent and a dominating set of G. The independent domination number i(G) of G is the minimum cardinality of an independent
TRIANGLEFREE TRIANGULATIONS
, 901
"... Abstract. The flip operation on colored innertrianglefree triangulations of a convex polygon is studied. It is shown that the affine Weyl group eCn acts transitively on these triangulations by colored flips, and that the resulting colored flip graph is closely related to a lower interval in the we ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. The flip operation on colored innertrianglefree triangulations of a convex polygon is studied. It is shown that the affine Weyl group eCn acts transitively on these triangulations by colored flips, and that the resulting colored flip graph is closely related to a lower interval
Median Graphs and TriangleFree Graphs
, 1997
"... Let M(m;n) be the complexity of checking whether a graph G with m ..."
Abstract

Cited by 31 (14 self)
 Add to MetaCart
Let M(m;n) be the complexity of checking whether a graph G with m
TriangleFree Strongly CircularPerfect Graphs
 DISCRETE MATHEMATICS
, 2009
"... Zhu [15] introduced circularperfect graphs as a superclass of the wellknown perfect graphs and as an important χbound class of graphs with the smallest nontrivial χbinding function χ(G) ≤ ω(G)+1. Perfect graphs have been recently characterized as those graphs without odd holes and odd antihole ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
circularperfect if its complement is circularperfect as well. This subclass entails perfect graphs, odd holes, and odd antiholes. As main result, we fully characterize the trianglefree strongly circularperfect graphs, and prove that, for this graph class, both the stable set problem and the recognition
Trianglefree subgraphs at the trianglefree process
, 903
"... We consider the trianglefree process: given an integer n, start by taking a uniformly random ordering of the edges of the complete nvertex graph Kn. Then, traverse the ordered edges and add each traversed edge to an (initially empty) evolving graph unless its addition creates a triangle. We study ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
We consider the trianglefree process: given an integer n, start by taking a uniformly random ordering of the edges of the complete nvertex graph Kn. Then, traverse the ordered edges and add each traversed edge to an (initially empty) evolving graph unless its addition creates a triangle. We
Small Trianglefree . . . lines
, 2004
"... In the paper we show that all combinatorial trianglefree configurations for v ≤ 18 are geometrically realizable. We also show that there is a unique smallest astral (183) trianglefree configuration and its Levi graph is the generalized Petersen graph G(18, 5). In addition, we present geometric rea ..."
Abstract
 Add to MetaCart
In the paper we show that all combinatorial trianglefree configurations for v ≤ 18 are geometrically realizable. We also show that there is a unique smallest astral (183) trianglefree configuration and its Levi graph is the generalized Petersen graph G(18, 5). In addition, we present geometric
Results 1  10
of
362,178