GraphTheory - Maple Programming Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : Mathematics : Discrete Mathematics : Graph Theory : GraphTheory Package : GraphTheory/Mycielski

GraphTheory

  

Mycielski

 

Calling Sequence

Parameters

Description

Examples

Calling Sequence

Mycielski(G)

Parameters

G

-

undirected graph

Description

• 

Mycielski is a graph construction which, given a graph G on n vertices, returns a graph on 2n+1 vertices. If G is triangle-free with chromatic number k, then the returned graph is triangle-free with chromatic number k+1.

Examples

withGraphTheory:

withSpecialGraphs:

PPetersenGraph

PGraph 1: an undirected unweighted graph with 10 vertices and 15 edge(s)

(1)

GMycielskiP

GGraph 2: an undirected unweighted graph with 21 vertices and 55 edge(s)

(2)

ChromaticNumberG,bound

3..4

(3)

ChromaticNumberG

4

(4)

See Also

ChromaticNumber