✦ LIBER ✦

Edge-disjoint spanners of complete bipartite graphs

✍ Scribed by Christian Laforest; Arthur L. Liestman; Thomas C. Shermer; Dominique Sotteau

Book ID: 108315525
Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 141 KB
Volume: 234
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00192-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Vertex-Disjoint Complete Bipartite Su

On Vertex-Disjoint Complete Bipartite Subgraphs in a Bipartite Graph

✍ Hong Wang 📂 Article 📅 1999 🏛 Springer Japan 🌐 English ⚖ 150 KB

A decomposition of complete bipartite gr

A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components

✍ Yoshimi Egawa; Masatsugu Urabe; Toshihito Fukuda; Seiichiro Nagoya 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 114 KB

Edge-disjoint Open Trails in Complete Bi

Edge-disjoint Open Trails in Complete Bipartite Multigraphs

✍ Sylwia Cichacz; Agnieszka Görlich 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 135 KB

Vertex-disjoint quadrilaterals containin

Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph

✍ Jin Yan; Guizhen Liu 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 282 KB

Bipartite Graphs Whose Edge Algebras Are

Bipartite Graphs Whose Edge Algebras Are Complete Intersections

✍ Mordechai Katzman 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 115 KB

Let R be a monomial subalgebra of k x 1 x N generated by square free monomials of degree two. This paper addresses the following question: when is R a complete intersection? For such a k-algebra we can associate a graph G whose vertices are x 1 x N and whose edges are x i x j x i x j ∈ R . Convers

The maximum edge-disjoint paths problem

The maximum edge-disjoint paths problem in complete graphs

✍ Adrian Kosowski 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 426 KB