Found 55 Documents (Results 1–55)
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties. (English) Zbl 1522.05091
Packing of mixed hyperarborescences with flexible roots via matroid intersection. (English) Zbl 1470.05132
A discharging method to find subgraphs having two edge-disjoint spanning trees. (English) Zbl 1449.05158
Nowhere-zero 3-flow and \(\mathbb{Z}_3\)-connectedness in graphs with four edge-disjoint spanning trees. (English) Zbl 1393.05138
Packing arborescences in random digraphs. (English) Zbl 1379.05101
Drmota, Michael (ed.) et al., Extended abstracts of the ninth European conference on combinatorics, graph theory and applications, EuroComb 2017, Vienna, Austria, August 28 – September 1, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 61, 615-621 (2017).
Construction independent spanning trees on locally twisted cubes in parallel. (English) Zbl 1367.05032
Edge-disjoint spanning trees, edge connectivity, and eigenvalues in graphs. (English) Zbl 1409.05120
Generic global rigidity of body-hinge frameworks. (English) Zbl 1330.05040
MSC:
05C05
Edge-disjoint spanning trees and eigenvalues. (English) Zbl 1297.05149
Reviewer: Sebastian Cioaba (Newark)
Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid. (English) Zbl 1251.05028
Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees. (English) Zbl 1248.05174
Broadcasting secure messages via optimal independent spanning trees in folded hypercubes. (English) Zbl 1225.68138
Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes. (English) Zbl 1229.68057
Brick partitions of graphs. (English) Zbl 1243.05199
A proof of the molecular conjecture. (English) Zbl 1388.52017
Proceedings of the 25th annual symposium on computational geometry, SCG 2009, Aarhus, Denmark, June 8–10, 2009. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-501-7). 296-305 (2009).
MSC:
52C25
Partitioning bispanning graphs into spanning trees. (English) Zbl 1235.05111
Miller, Mirka (ed.) et al., Proceedings of the 19th international workshop on combinatorial algorithms, IWOCA 2008, Nagoya, Japan, September 12–15, 2008. London: College Publications (ISBN 978-1-904987-74-1/pbk). Texts in Algorithmics 12, 50-62 (2009).
Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs. (English) Zbl 1142.05352
Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs. (English) Zbl 1059.68081
MSC:
68R10
On edge-disjoint spanning trees in hypercubes. (English) Zbl 1002.68103
MSC:
68R10
Edge-disjoint minimum-weight connected spanning \(k\)-edge subgraphs in a weighted graph: A connectedness theorem. (English) Zbl 0956.05064
MSC:
05C40
Decomposition of some planar graphs into trees. (English) Zbl 0854.05033
Reviewer: C.Thomassen (Lyngby)
Strategies for the Shannon switching game. (English) Zbl 0846.90148
MSC:
91A43
Randomized parallel algorithms for matroid union and intersection, with applications to arborescences and edge-disjoint spanning trees. (English) Zbl 0796.05021
Reviewer: A.Recski (Budapest)
Randomized parallel algorithms for matroid union and intersection, with applications to arboresences and edge-disjoint spanning trees. (English) Zbl 0815.05021
Frederickson, Greg (ed.), Proceedings of the third annual ACM-SIAM symposium on discrete algorithms, held January 27-29, 1992, in Orlando, FL, USA. Philadelphia, PA: SIAM. 357-366 (1992).
Spanning trails joining two given edges. (English) Zbl 0841.05067
Alavi, Yousef (ed.) et al., Graph theory, combinatorics, and applications, Vol. 1. Proceedings of the sixth quadrennial international conference on the theory and applications of graphs held at Western Michigan University, Kalamazoo, Michigan, May 30-June 3, 1988. New York: John Wiley & Sons Ltd. Wiley-Interscience Publication. 207-222 (1991).
The arboricity of the random graph. (English) Zbl 0755.05088
Graph theory, combinatorics, algorithms, and applications, Proc. 2nd Int. Conf., San Francisco/CA (USA) 1989, 119-124 (1991).
Reviewer: N.Renganathan (Annamalai Nagar)
Nearly-Eulerian spanning subgraphs. (English) Zbl 0659.05077
Reviewer: H.-P.Presia
Efficient algorithms for graphic matroid intersection and parity. (English) Zbl 0567.05002
Automata, languages and programming, 12th Colloq., Nafplion/Greece 1985, Lect. Notes Comput. Sci. 194, 210-220 (1985).
On some problems related to fundamental cycle sets of a graph: research notes. (English) Zbl 0544.05041
Discrete mathematics, Banach Cent. Publ. 7, 145-157 (1982).
Reviewer: H.Gerber
Ein Reduktionsverfahren für weg-endliche Graphen. (Dissertation). (German) Zbl 0526.05059
Fachbereich Mathematik der Universität Hamburg. 76 S. (1982).
On disjoint trees and arborescences. (English) Zbl 0507.05054
Algebraic methods in graph theory, Vol. I, Cont. Szeged 1978, Colloq. Math. Soc. Janos Bolyai 25, 159-169 (1981).
Filter Results by …
Document Type
- Journal Articles (45)
- Collection Articles (9)
- Books (1)
all
top 5
Author
- Lai, Hong-Jian (14)
- Catlin, Paul A. (4)
- Gu, Xiaofeng (4)
- Li, Ping (4)
- Bang-Jensen, Jørgen (3)
- Chang, Jou-Ming (3)
- Hasunuma, Toru (3)
- Jordán, Tibor (3)
- Li, Xueliang (3)
- Liang, Yanting (3)
- Tanigawa, Shin-ichi (3)
- Yang, Jinn-Shyong (3)
- Baumgart, Matthias (2)
- Chen, Zhihong (2)
- Hong, Yanmei (2)
- Hsieh, Sun-Yuan (2)
- Kriesell, Matthias (2)
- Li, Jiaao (2)
- Liu, Qinghai (2)
- Narayanan, H. (2)
- Saran, Huzur (2)
- Vazirani, Vijay V. (2)
- Yao, Senmei (2)
- Aichholzer, Oswin (1)
- Bailey, Robert F. (1)
- Barden, Benjamin (1)
- Chan, Hung-Chang (1)
- Chang, Yu-Huei (1)
- Cioabă, Sebastian M. (1)
- Davis, Janet (1)
- Frank, András (1)
- Gabow, Harold N. (1)
- Gonçalves, Daniel (1)
- Gørtz, Inge Li (1)
- Gusfield, Dan (1)
- Hackl, Thomas (1)
- Han, Miaomiao (1)
- Han, Zheng-Yiao (1)
- Havet, Frédéric (1)
- Hoppen, Carlos (1)
- Hörsch, Florian (1)
- Hsu, Chiun-Chieh (1)
- Jackson, Bill (1)
- Katoh, Naoki (1)
- Király, Csaba (1)
- Korman, Matias (1)
- Li, Hengzhe (1)
- Li, Shasha (1)
- Li, Wei (1)
- Libeskind-Hadas, Ran (1)
- Lin, Chintsai (1)
- Lin, Jia-Cian (1)
- Liu, Damin (1)
- Liu, Ruifang (1)
- Löffler, Maarten (1)
- Mansfield, Richard (1)
- Mao, Yaping (1)
- Morisaka, Chie (1)
- Newman, Michael William (1)
- Oxley, James G. (1)
- Parente, Roberto F. (1)
- Petrović, Vojislav (1)
- Pilz, Alexander (1)
- Roskind, James (1)
- Sato, Cristiane Maria (1)
- Schmidt, Rudiger (1)
- Speckmann, Bettina (1)
- Stallmann, Matthias F. M. (1)
- Stevens, Brett (1)
- Syslo, Maciej M. (1)
- Szigeti, Zoltán (1)
- Tarjan, Robert Endre (1)
- Tay, Tiongseng (1)
- Tian, Yingzhi (1)
- Tu, Chang-Jen (1)
- van Kreveld, Marc J. (1)
- Wang, Keke (1)
- Wang, Yue-Li (1)
- Welzl, Emo (1)
- Wong, Wiseley (1)
- Xu, Jinquan (1)
- Yang, Ming-Chien (1)
- Yeo, Anders (1)
- Yue, Jun (1)
- Zhan, Mingquan (1)
all
top 5
Serial
- Discrete Math. (6)
- Inf. Process. Lett. (5)
- Ars Comb. (4)
- J. Comb. Theory, Ser. B (4)
- J. Graph Theory (4)
- Linear Algebra Appl. (4)
- Discrete Appl. Math. (3)
- Am. Math. Mon. (1)
- Inf. Sci. (1)
- Math. Oper. Res. (1)
- Networks (1)
- SIAM J. Comput. (1)
- Theor. Comput. Sci. (1)
- Graphs Comb. (1)
- Appl. Math. Lett. (1)
- J. Parallel Distrib. Comput. (1)
- Australas. J. Comb. (1)
- Electron. J. Comb. (1)
- J. Comb. Optim. (1)
- J. Discrete Algorithms (1)
- Discrete Optim. (1)
- Math. Comput. Sci. (1)
