Drawing a graph in a hypercube.
Wood, David R. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Maximal flat antichains of minimum weight.”
Drawing a graph in a hypercube.
Chromatic graphs, Ramsey numbers and the flexible atom conjecture.
Alm, Jeremy F., Maddux, Roger D., Manske, Jacob (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Constructions of (2,n)-varieties of groupoids for n = 7, 8, 9
Lidija Goraèinova-Ilieva, Smile Markovski (2007)
Publications de l'Institut Mathématique
Similarity:
Three-variable equations of posets
Jaroslav Ježek (2002)
Czechoslovak Mathematical Journal
Similarity:
We find an independent base for three-variable equations of posets.
Saturation numbers of books.
Chen, Guantao, Faudree, Ralph J., Gould, Ronald J. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The group Sp10(ℤ) is (2,3)-generated
Vadim Vasilyev, Maxim Vsemirnov (2011)
Open Mathematics
Similarity:
It is proved that the group Sp10(ℤ) is generated by an involution and an element of order 3.
Relaxations of Ore's condition on cycles.
Ainouche, Ahmed (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Double-critical graphs and complete minors.
Kawarabayashi, Ken-Ichi, Pedersen, Anders Sune, Toft, Bjarne (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Deficiency of forests
Sana Javed, Mujtaba Hussain, Ayesha Riasat, Salma Kanwal, Mariam Imtiaz, M. O. Ahmad (2017)
Open Mathematics
Similarity:
An edge-magic total labeling of an (n,m)-graph G = (V,E) is a one to one map λ from V(G) ∪ E(G) onto the integers {1,2,…,n + m} with the property that there exists an integer constant c such that λ(x) + λ(y) + λ(xy) = c for any xy ∈ E(G). It is called super edge-magic total labeling if λ (V(G)) = {1,2,…,n}. Furthermore, if G has no super edge-magic total labeling, then the minimum number of vertices added to G to have a super edge-magic total labeling, called super edge-magic deficiency...