The chromatic number of extended odd graphs is four

Marie Sokolová

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

The search session has expired. Please query the service again.

Displaying similar documents to “The chromatic number of extended odd graphs is four”

An extremal theorem in the hypercube.

Conlon, David (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Edge domination in graphs of cubes

Bohdan Zelinka (2002)

Czechoslovak Mathematical Journal

Similarity:

The signed edge domination number and the signed total edge domination number of a graph are considered; they are variants of the domination number and the total domination number. Some upper bounds for them are found in the case of the $n$ -dimensional cube $Q_{n}$ .

The cube polynomial and its derivatives: The case of median graphs.

Brešar, Boštjan, Klavžar, Sandi, Škrekovski, Riste (2003)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Greatest common subgraphs of graphs

Gary Chartrand, Farrokh Saba, Hung Bin Zou (1987)

Časopis pro pěstování matematiky

Similarity: