✦ LIBER ✦

A Sublinear Bipartiteness Tester for Bounded Degree Graphs

✍ Scribed by Oded Goldreich; Dana Ron

Publisher: Springer-Verlag
Year: 1999
Tongue: English
Weight: 443 KB
Volume: 19
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s004930050060

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sum Coloring of Bipartite Graphs with Bo

Sum Coloring of Bipartite Graphs with Bounded Degree

✍ Michal Malafiejski; Krzysztof Giaro; Robert Janczewski; Marek Kubale 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 580 KB

On locating cubic subgraphs in bounded-d

On locating cubic subgraphs in bounded-degree connected bipartite graphs

✍ Iain A Stewart 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 236 KB

We show that the problem of deciding whether a connected bipartite graph of degree at most 4 has a cubic subgraph is NP-complete.

Minimum degree thresholds for bipartite

Minimum degree thresholds for bipartite graph tiling

✍ Albert Bush; Yi Zhao 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 361 KB

## Abstract Given a bipartite graph __H__ and a positive integer __n__ such that __v__(__H__) divides 2__n__, we define the minimum degree threshold for bipartite __H__‐tiling, δ~2~(__n, H__), as the smallest integer __k__ such that every bipartite graph __G__ with __n__ vertices in each partition

Small Universal Graphs for Bounded-Degre

Small Universal Graphs for Bounded-Degree Planar Graphs

✍ Michael Capalbo 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 265 KB

Induced-Universal Graphs for Graphs with

Induced-Universal Graphs for Graphs with Bounded Maximum Degree

✍ Steve Butler 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 213 KB

Judicious partitions of bounded-degree g

Judicious partitions of bounded-degree graphs

✍ B. Bollobás; A. D. Scott 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 1 views

## Abstract We prove results on partitioning graphs __G__ with bounded maximum degree. In particular, we provide optimal bounds for bipartitions __V__(__G__) = __V__~1~ ∪ __V__~2~ in which we minimize {__e__(__V__~1~), __e__(__V__~2~)}. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 131–143, 200