Split graphs

European Journal of Combinatorics - Tập 24 - Trang 413-430 - 2003
Russell Merris1
1Department of Mathematics and Computer Science, California State University, Hayward, CA 94542, USA

Tài liệu tham khảo

Arikati, 1994, Degree sequences and majorization, Linear Algebra Appl., 199, 179, 10.1016/0024-3795(94)90349-2

J.T.B. Beard Jr., A.D. Dorris, On uniquely realizable degree sequences (manuscript)

Chvátal, 1977, Aggregation of inequalities in integer programming, Annals Disc. Math., 1, 145, 10.1016/S0167-5060(08)70731-3

Edelman, 1994, Free hyperplane arrangements between An−1 and Bn, Math. Z., 215, 347, 10.1007/BF02571719

Foldes, 1977, Split graphs, 311

Grund, 1993, Konstruktion schlichter Graphen mit gegebener Gradpartition (Construction of univalent graphs with given partition by degree), Bayreuth. Math. Schr., 44, 73

Hammer, 1981, Threshold sequences, SIAM J. Alg. Disc. Meth., 2, 39, 10.1137/0602006

Harary, 1987, Hamiltonian threshold graphs, Disc. Appl. Math., 16, 11, 10.1016/0166-218X(87)90050-3

Hässelbarth, 1984, Die Verzweigtheit von Graphen, (MATCH) Comm. Math. & Computer Chem., 16, 3

Henderson, 1977, A graph-theoretic characterization of the PVchunk class of synchronizing primitives, SIAM. J. Comput., 6, 88, 10.1137/0206008

Ibaraki, 1981, Sufficient conditions for graphs to have threshold number 2, 241

Kelmans, 2001, On homotopy of connected graphs having the same degree function, Discrete Math., 230, 167, 10.1016/S0012-365X(00)00079-0

Kleitman, 1975, A note on unigraphic sequences, Stud. Appl. Math., 54, 283, 10.1002/sapm1975544283

Koren, 1973, Extreme degree sequences of simple graphs, J. Combin. Theory Ser. B, 15, 213, 10.1016/0095-8956(73)90037-3

Mahadev, 1988, Strict 2-threshold graphs, Discrete Appl. Math., 21, 113, 10.1016/0166-218X(88)90048-0

Mahadev, 1995

Marshall, 1979

Merris, 1994, Degree maximal graphs are Laplacian integral, Linear Algebra Appl., 199, 381, 10.1016/0024-3795(94)90361-1

Merris, 1996, Threshold graphs, 205

Merris, 2001

R. Merris, T. Roby, The lattice of threshold graphs (manuscript)

Orlin, 1977, The minimal integral separator of a threshold graph, Annals Disc. Math., 1, 415, 10.1016/S0167-5060(08)70749-0

Parthasarathy, 1968, Enumeration of graphs with given partition, Canad. J. Math., 20, 40, 10.4153/CJM-1968-005-0

Peled, 1980, Threshold graph enumeration and series-product identities, Congr. Numer., 291, 735

Peled, 1989, The polytope of degree sequences, Linear Algebra Appl., 114–115, 349, 10.1016/0024-3795(89)90470-9

Ruch, 1979, The branching extent of graphs, J. Combin. Inform. System Sci., 4, 285

Ryser, 1963, vol. 14

Sierksma, 1991, Seven criteria for sequences being graphic, J. Graph Theory, 15, 223, 10.1002/jgt.3190150209

Tyshkevich, 2000, Decompostion of graphical sequences and unigraphs, Discrete Math., 220, 201, 10.1016/S0012-365X(99)00381-7

Will, 1999, Switching distances between graphs with the same degree, SIAM J. Discrete Math., 12, 298, 10.1137/S0895480197331156