✦ LIBER ✦

Covering weighted graphs by even subgraphs

✍ Scribed by Genghua Fan

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 225 KB
Volume: 49
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(90)90067-a

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bipartite subgraphs of integer weighted

Bipartite subgraphs of integer weighted graphs

✍ Noga Alon; Eran Halperin 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 411 KB

For every integer p > 0, let f(p) be the minimum possible value of the maximum weight of a cut in an integer weighted graph with total weight p. It is shown that for every large n and every m < n, f((~)+m)= L¼n2j +min (I½nT,f(m)). This supplies the precise value of f(p) for many values of p includin

Spanning even subgraphs of 3-edge-connec

Spanning even subgraphs of 3-edge-connected graphs

✍ Bill Jackson; Kiyoshi Yoshimoto 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 344 KB

## Abstract By Petersen's theorem, a bridgeless cubic graph has a 2‐factor. H. Fleischner extended this result to bridgeless graphs of minimum degree at least three by showing that every such graph has a spanning even subgraph. Our main result is that, under the stronger hypothesis of 3‐edge‐connec

Covering the edges of a graph by three o

Covering the edges of a graph by three odd subgraphs

✍ Tamás Mátrai 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB

Covering genus-reducing edges by Kuratow

Covering genus-reducing edges by Kuratowski subgraphs

✍ Brunet, Richard; Richter, R. Bruce; ?ir�?, Jozef 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 373 KB

If G is a graph that minimally does not embed in a nonorientable surface, then each edge of G is in a subdivision of either K3.3 or K5. However, there is an example of a graph that minimally does not embed in the torus and some edge is in no subdivision of either K3.3 or K5.

Path covers of weighted graphs

✍ Genghua Fan 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 318 KB

Let (G, w ) denote a simple graph G with a weight function w : €(G) -{0,1,2}. A path cover of (G, w ) is a collection of paths in G such that every edge e is contained in exactly w(e) paths of the collection. For a vertex u , w ( v ) is the sum of the weights of the edges incident with U ; U is call

Characterizing path graphs by forbidden

Characterizing path graphs by forbidden induced subgraphs

✍ Benjamin Lévêque; Frédéric Maffray; Myriam Preissmann 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB

## Abstract A path graph is the intersection graph of subpaths of a tree. In 1970, Renz asked for a characterization of path graphs by forbidden induced subgraphs. We answer this question by determining the complete list of graphs that are not path graphs and are minimal with this property. © 2009