Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/partitioning-bispanning-graphs-into-spanning-trees-RVTM0K0KBC
References (17)
-
W. Cook, W. Cunningham, W. Pulleyblank, A. Schrijver (1997)
Combinatorial optimization -
Jonathan Gross, J. Yellen, Mark Anderson (2018)
Spanning TreesGraph Theory and Its Applications
-
(1978)
On the second maximal spanning trees of a weighted graph. Transactions of the IECE of Japan -
R. Prim (1957)
Shortest connection networks and some generalizationsBell System Technical Journal, 36
-
R. Brualdi (1969)
Comments on bases in dependence structuresBulletin of the Australian Mathematical Society, 1
-
Tom Brylawski (1973)
Some properties of basic families of subsetsDiscret. Math., 6
-
J. Bondy (1972)
Transversal matroids, base-orderable matroids, and graphsQuarterly Journal of Mathematics, 23
-
T. Kawamoto, Y. Kajitani, S. Shinoda (1978)
On the second maximal spanning trees of a weighted graph (in Japanese)Trans. IECE Jpn., 61-A
-
A. Schrijver (1990)
A Course in Combinatorial Optimization -
J. Oxley (1992)
Matroid theory -
(1926)
jistém problému minimálnı́m -
J. Keijsper, R. Pendavingh, A. Schrijver (2000)
Adjacency, Inseparability, and Base Orderability in MatroidsEur. J. Comb., 21
-
G. Dirac (1952)
A Property of 4-Chromatic Graphs and some Remarks on Critical GraphsJournal of The London Mathematical Society-second Series
-
M. Kano (1987)
Maximum andk-th maximal spanning trees of a weighted graphCombinatorica, 7
-
J. Kruskal (1956)
On the shortest spanning subtree of a graph and the traveling salesman problem, 7
-
E.W. Mayr, C.G. Plaxton (1992)
On the spanning trees of weighted graphsCombinatorica, 12
-
(2008)
Partitioning bispanning graphs into spanning trees
- Publisher
- Springer Journals
- Copyright
- Copyright © 2009 by Birkhäuser Verlag Basel/Switzerland
- Subject
- Mathematics; Mathematics, general; Computer Science, general
- ISSN
- 1661-8270
- eISSN
- 1661-8289
- DOI
- 10.1007/s11786-009-0011-z
- Publisher site
- See Article on Publisher Site
Abstract
Given a weighted bispanning graph $${{\mathcal B} = (V, P, Q)}$$ consisting of two edge-disjoint spanning trees P and Q such that w(P) < w(Q) and Q is the only spanning tree with weight w(Q), it is conjectured that there are |V| − 1 spanning trees with pairwise different weight where each of them is smaller than w(Q). This conjecture due to Mayr and Plaxton is proven for bispanning graphs restricted in terms of the underlying weight function and the structure of the bispanning graphs. Furthermore, a slightly stronger conjecture is presented and proven for the latter class.
Journal
Mathematics in Computer Science – Springer Journals
Published: Nov 27, 2009