Shifted set families, degree sequences, and plethysm.
Klivans, C., Reiner, V. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “The polytope of degree partitions.”
Shifted set families, degree sequences, and plethysm.
Low-degree graph partitioning via local search with applications to constraint satisfaction, max cut, and coloring.
Halldórsson, Magnús M., Lau, Hoong Chuin (1997)
Journal of Graph Algorithms and Applications
Similarity:
Clique-connecting forest and stable set polytopes
Denis Cornaz (2010)
RAIRO - Operations Research
Similarity:
Let be a simple undirected graph. A forest ⊆ of is said to be if each tree of spans a clique of . This paper adresses the clique-connecting forest polytope. First we give a formulation and a polynomial time separation algorithm. Then we show that the nontrivial nondegenerate facets of the stable set polytope are facets of the clique-connecting polytope. Finally we introduce a family of rank inequalities which are facets, and which generalize the clique inequalities. ...
Graph compositions. I: Basic enumeration.
Knopfmacher, A., Mays, M.E. (2001)
Integers
Similarity:
The face labeling of maximal planar graphs.
Cahit, Ibrahim (2011)
Applied Mathematics E-Notes [electronic only]
Similarity:
The Ramsey numbers of large cycles versus small wheels.
Surahmat, Baskoro, E.T., Broersma, H.J. (2004)
Integers
Similarity:
Characterization of -bar visibility trees.
Chen, Guantao, Hutchinson, Joan P., Keating, Ken, Shen, Jian (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dense -free graphs are almost -partite.
Allen, Peter (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The edge-count criterion for graphic lists.
Isaak, Garth, West, Douglas B. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
-vectors, Eulerian polynomials and stable polytopes of graphs.
Athanasiadis, Christos A. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the monotone upper bound problem.
Pfeifle, Julian, Ziegler, Günter M. (2004)
Experimental Mathematics
Similarity:
On degree sequences of graphs with given cyclomatic number.
Schocker, Manfred (2001)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
A Turán type problem concerning the powers of the degrees of a graph.
Caro, Yair, Yuster, Raphael (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ehrhart clutters: regularity and max-flow min-cut.
Martínez-Bernal, José, O'Shea, Edwin, Villarreal, Rafael H. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity: