Some Heuristics in Automatic Theorem Proving

Dragoš Cvetković; Irena Pevac

Displaying similar documents to “Some Heuristics in Automatic Theorem Proving”

On subgraphs induced by transversals in vertex-partitions of graphs.

Axenovich, Maria (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Online coloring known graphs.

Halldórsson, Magnús M. (2000)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A note on graph coloring extensions and list-colorings.

Axenovich, Maria (2003)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Even kernels.

Fraenkel, Aviezri (1994)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Avoiding rainbow induced subgraphs in vertex-colorings.

Axenovich, Maria, Martin, Ryan (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Computation of the vertex Folkman numbers $F (2, 2, 2, 4; 6)$ and $F (2, 3, 4; 6)$ .

Nedialkov, Evgeni, Nenov, Nedyalko (2002)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Worm Colorings

Wayne Goddard, Kirsti Wash, Honghai Xu (2015)

Discussiones Mathematicae Graph Theory

Similarity:

Given a coloring of the vertices, we say subgraph H is monochromatic if every vertex of H is assigned the same color, and rainbow if no pair of vertices of H are assigned the same color. Given a graph G and a graph F, we define an F-WORM coloring of G as a coloring of the vertices of G without a rainbow or monochromatic subgraph H isomorphic to F. We present some results on this concept especially as regards to the existence, complexity, and optimization within certain graph classes....