Can a Graph Have Distinct Regular Partitions?
- 期刊名称SIAM Journal on Discrete Mathematics
- 作者Alon, Noga; Shapira, Asaf; Stav, Uri
- 卷第23卷
- 期第1期
- 印刷ISSN0895-4801
- 电子ISSN1095-7146
- 文件大小202.73KB
- 发表时间2009-01
- DOI10.1137/070695952
- 页码278-287
Sorting by Transpositions Is DifficultBulteau, Laurent; Fertin, Guillaume; Rusu, Irena · SIAM Journal on Discrete Mathematics · 2012
Planar SeparatorsAlon, Noga; Seymour, Paul; Thomas, Robin · SIAM Journal on Discrete Mathematics · 1994
Comparing Top <i>k</i> ListsFagin, Ronald; Kumar, Ravi; Sivakumar, D. · SIAM Journal on Discrete Mathematics · 2003
Spanning Trees with Many LeavesKleitman, Daniel J.; West, Douglas B. · SIAM Journal on Discrete Mathematics · 1991
Embedding into Bipartite GraphsBöttcher, Julia; Heinig, Peter; Taraz, Anusch · SIAM Journal on Discrete Mathematics · 2010
Binary NontilesCoppersmith, Don; Miller, Victor S. · SIAM Journal on Discrete Mathematics · 2012
Cycle Lengths and Graph OrientationsPretzel, Oliver; Youngs, Dale · SIAM Journal on Discrete Mathematics · 1990
Rigidity MatroidsGraver, Jack E. · SIAM Journal on Discrete Mathematics · 1991