Disjoint Representation of Tree Realizable Sequences
- 1 January 1974
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 26 (1) , 103-107
- https://doi.org/10.1137/0126006
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The k-factor conjecture is truePublished by Elsevier ,2003
- Algorithms for constructing graphs and digraphs with given valences and factorsDiscrete Mathematics, 1973
- On factorable degree sequencesJournal of Combinatorial Theory, Series B, 1972
- Lehmans switching game and a theorem of Tutte and Nash-WilliamsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- A Solution of the Shannon Switching GameJournal of the Society for Industrial and Applied Mathematics, 1964
- Existence of k-edge connected ordinary graphs with prescribed degreesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1964
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. UniquenessJournal of the Society for Industrial and Applied Mathematics, 1963
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. IJournal of the Society for Industrial and Applied Mathematics, 1962
- Partitions and Their Representative GraphsAmerican Journal of Mathematics, 1951