✦ LIBER ✦

On Halin subgraphs and supergraphs

✍ Scribed by S.B. Horton; R.Gary Parker

Book ID: 104184522
Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 978 KB
Volume: 56
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)e0131-h

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Note on regular subgraphs

✍ R�dl, Vojtech; Wysocka, Beata 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB

Let f (n, γ) denote the largest integer r such that any graph G on n vertices with γn 2 edges contains an r-regular subgraph. In this paper we prove that

On maximum bipartite subgraphs

✍ Günther Malle 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 314 KB

## Abstract In this paper are investigated maximum bipartite subgraphs of graphs, i.e., bipartite subgraphs with a maximum number of edges. Such subgraphs are characterized and a criterion is given for a subgraph to be a unique maximum bipartite subgraph of a given graph. In particular maximum bipa

On orienting graphs for connectivity: Pr

On orienting graphs for connectivity: Projective planes and Halin graphs

✍ Joseph Cheriyan; Chenglong Zou 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 215 KB

On finding spanning eulerian subgraphs

✍ M. B. Richey; R. Gary Parker; R. L. Rardin 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 649 KB

On the complete chromatic number of Hali

On the complete chromatic number of Halin graphs

✍ Zhongfu Zhang; Linzhong Liu 📂 Article 📅 1997 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 300 KB

On k-detour subgraphs of hypercubes

✍ Nana Arizumi; Peter Hamburger; Alexandr Kostochka 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB

## Abstract A spanning subgraph __G__ of a graph __H__ is a __k__‐__detour subgraph__ of __H__ if for each pair of vertices $x,y \in V(H)$, the distance, ${\rm dist}\_G(x,y)$, between __x__ and __y__ in __G__ exceeds that in __H__ by at most __k__. Such subgraphs sometimes also are called __additiv