Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Mycielskian

Known as: Mycielski, Mycielski graph 
In the mathematical area of graph theory, the Mycielskian or Mycielski graph of an undirected graph is a larger graph formed from it by a… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
We consider !-chaos as defined by S. H. Li in 1993. We show that c-dense !-scrambled sets are present in every transitive system… Expand
Is this relevant?
2005
2005
The aim of the Kaczmarz algorithm is to reconstruct an element in a Hilbert space from data given by inner products of this… Expand
Is this relevant?
2004
2004
  • D. Liu
  • Discret. Math.
  • 2004
  • Corpus ID: 16699960
Abstract For a graph G , let M( G ) denote the Mycielski graph of G . The t th iterated Mycielski graph of G , M t ( G ), is… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
GRAPHS AND THEIR COMPLEMENTS Degree sequences Analysis PATHS AND WALKS Complexity Walks The shortest path problem Weighted graphs… Expand
Is this relevant?
2002
2002
Let γf(G) and Γf(G) be the fractional domination number and fractional total domination number, resp., of a graph G. We show that… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2001
2001
Abstract In this work we give a new lower bound on the chromatic number of a Mycielski graph Mi. The result exploits a mapping… Expand
Is this relevant?
1998
1998
We give a forcing free proof of a conjecture of Mycielski that the fundamental group of a connected locally connected compact… Expand
Is this relevant?
Highly Cited
1995
Highly Cited
1995
James Propp The most familiar construction of graphs whose clique number is much smaller than their chromatic number is due to… Expand
Is this relevant?
1992
1992
Abstract Let H be a bipartie graph and let G n be the Mycielski graph with χ( G ) = n , n ⩾ 4. Then the chromatic number of the… Expand
  • figure 1
  • figure 2
Is this relevant?
1983
1983
A general theorem is proved which implies that the types of PA (Peano Arithmetic), ZF (Zermelo-Fraenkel Set Theory) and GB (Gödel… Expand
Is this relevant?