An extremal theorem in the hypercube.
Conlon, David (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “The chromatic number of extended odd graphs is four”
An extremal theorem in the hypercube.
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 -dimensional cube .
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:
On magic joins of graphs
Jaroslav Ivančo, Tatiana Polláková (2012)
Mathematica Bohemica
Similarity:
A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise different (and consecutive) integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we characterize magic joins of graphs and we establish some conditions for magic joins of graphs to be supermagic.
Sierpiński graphs as spanning subgraphs of Hanoi graphs
Andreas Hinz, Sandi Klavžar, Sara Zemljič (2013)
Open Mathematics
Similarity:
Hanoi graphs H pn model the Tower of Hanoi game with p pegs and n discs. Sierpinski graphs S pn arose in investigations of universal topological spaces and have meanwhile been studied extensively. It is proved that S pn embeds as a spanning subgraph into H pn if and only if p is odd or, trivially, if n = 1.