✦ LIBER ✦

Algorithms for Degree Constrained Graph Factors of Minimum Deficiency

✍ Scribed by P. Hell; D.G. Kirkpatrick

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 1008 KB
Volume: 14
Category: Article
ISSN: 0196-6774
DOI: 10.1006/jagm.1993.1006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sufficient conditions for equality of co

Sufficient conditions for equality of connectivity and minimum degree of a graph

✍ Jerzy Topp; Lutz Volkmann 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 270 KB 👁 1 views

## Abstract For a graph __G__, let __n__(__G__), κ(__G__) and δ(__G__) denote the order, the connectivity, and the minimum degree of __G__, respectively. The paper contains some conditions on __G__ implying κ(__G__) = δ(__G__). One of the conditions is that __n__(__G__) ≤ δ(__G__)(2__p__ −1)/(2__p_

A parallel algorithm for minimum weighte

A parallel algorithm for minimum weighted colouring of triangulated graphs

✍ Chính T. Hoàng 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 631 KB

An algorithm for finding factorizations

An algorithm for finding factorizations of complete graphs

✍ A. J. W. Hilton; Matthew Johnson 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 58 KB 👁 1 views

## Abstract We show how to find a decomposition of the edge set of the complete graph into regular factors where the degree and edge‐connectivity of each factor is prescribed. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 132–136, 2003

A sufficient condition for equality of e

A sufficient condition for equality of edge-connectivity and minimum degree of a graph

✍ Donald L. Goldsmith; Roger C. Entringer 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB 👁 1 views

## Abstract Let __G__ be a connected graph of order __p__ ≥ 2, with edge‐connectivity κ~1~(__G__) and minimum degree δ(__G__). It is shown her ethat in order to obtain the equality κ~1~(__G__) = δ(__G__), it is sufficient that, for each vertex __x__ of minimum degree in __G__, the vertices in the n

An algorithm for finding the minimum ske

An algorithm for finding the minimum skeleton of a growing graph

✍ G.B. Roshchin 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 325 KB

A degree condition for the existence of

A degree condition for the existence of regular factors inK1,n-free graphs

✍ Ota, Katsuhiro; Tokuda, Taro 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 260 KB 👁 2 views

A graph is called K1,.-free if it contains no K l , n as an induced subgraph. Let n ( r 3), r be integers (if r is odd, r 2 n -1). We prove that every Kl,,-free connected graph G with rlV(G)I even has an r-factor if its minimum degree is at least This degree condition is sharp.