Venn diagrams and symmetric chain decompositions in the Boolean lattice.
Griggs, Jerrold, Killian, Charles E., Savage, Carla D. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Half-simple symmetric Venn diagrams.”
Venn diagrams and symmetric chain decompositions in the Boolean lattice.
The centers of gravity of the associahedron and of the permutahedron are the same.
Hohlweg, Christophe, Lortie, Jonathan, Raymond, Annie (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Edge-bandwidth of the triangular grid.
Akhtar, Reza, Jiang, Tao, Pritikin, Dan (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Venn diagrams with few vertices.
Bultena, Bette, Ruskey, Frank (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on major sequences and external activity in trees.
Beissinger, Janet S., Peled, Uri N. (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions.
Gessel, Ira M., Sagan, Bruce E. (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Baxter permutations and plane bipolar orientations.
Bonichon, Nicolas, Bousquet-Mélou, Mireille, Fusy, Éric (2009)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Trees and matchings.
Kenyon, Richard W., Propp, James G., Wilson, David B. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On certain integral Schreier graphs of the symmetric group.
Gunnells, Paul E., Scott, Richard A., Walden, Byron L. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the Crossing Numbers of Cartesian Products of Stars and Graphs of Order Six
Marián Klešč, Štefan Schrötter (2013)
Discussiones Mathematicae Graph Theory
Similarity:
The crossing number cr(G) of a graph G is the minimal number of crossings over all drawings of G in the plane. According to their special structure, the class of Cartesian products of two graphs is one of few graph classes for which some exact values of crossing numbers were obtained. The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are known. Moreover, except of six graphs, the crossing numbers of Cartesian products G⃞K1,n for...
Parking functions and noncrossing partitions.
Stanley, Richard P. (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The number of elements in the mutation class of a quiver of type .
Buan, Aslak Bakke, Torkildsen, Hermund André (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Geometric simultaneous embeddings of a graph and a matching.
Cabello, Sergio, Van Kreveld, Marc, Liotta, Giuseppe, Meijer, Henk, Speckmann, Bettina, Verbeek, Kevin (2011)
Journal of Graph Algorithms and Applications
Similarity: