# Mycielskian

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- 2016

The dimension of a graph G is the smallest integer k such that G has a unitdistance representation in Euclidean space R. In thisâ€¦Â (More)

Is this relevant?

2012

2012

- Graphs and Combinatorics
- 2012

Mycielski introduced a new graph transformation Î¼(G) for graph G, which is called the Mycielskian of G. A graph G is superâ€¦Â (More)

Is this relevant?

2011

2011

- Formalized Mathematics
- 2011

Let Ï‰(G) and Ï‡(G) be the clique number and the chromatic number of a graph G. Mycielski [11] presented a construction that forâ€¦Â (More)

Is this relevant?

2010

2010

- Journal of Graph Theory
- 2010

A k-fold coloring of a graph is a function that assigns to each vertex a set of k colors, so that the color sets assigned toâ€¦Â (More)

Is this relevant?

2009

2009

- Appl. Math. Lett.
- 2009

In a search for triangle-free graphs with arbitrarily large chromatic numbers, Mycielski developed a graph transformation thatâ€¦Â (More)

Is this relevant?

2009

2009

- 2009

This paper treats in a systematic way the following question: which basic constructions in real and complex analysis lead fromâ€¦Â (More)

Is this relevant?

2008

2008

- IEEE International Conference on Granularâ€¦
- 2008

A k-fold coloring of a graph G is an assignment of k distinct colors to each vertex of G so that adjacent vertices receive noâ€¦Â (More)

Is this relevant?

2005

2005

- 2005

We investigate some topological properties of a normal functor H introduced earlier by Radul which is some functorialâ€¦Â (More)

Is this relevant?

1999

1999

- Journal of Graph Theory
- 1999

In a search for triangle-free graphs with arbitrarily large chromatic numbers, Mycielski developed a graph transformation thatâ€¦Â (More)

Is this relevant?

1998

1998

- 1998

We give a forcing free proof of a conjecture of Mycielski that the fundamental group of a connected locally connected compactâ€¦Â (More)

Is this relevant?