✦ LIBER ✦

Machine sequencing: Disjunctive graphs and degree-constrained subgraphs

✍ Scribed by Egon Balas

Publisher: John Wiley and Sons
Year: 1970
Tongue: English
Weight: 578 KB
Volume: 17
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800170102

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graph classes characterized both by forb

Graph classes characterized both by forbidden subgraphs and degree sequences

✍ Michael D. Barrus; Mohit Kumbhat; Stephen G. Hartke 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB

## Abstract Given a set ${\cal F}$ of graphs, a graph __G__ is ${\cal F}$‐free if __G__ does not contain any member of ${\cal F}$ as an induced subgraph. We say that ${\cal F}$ is a degree‐sequence‐forcing set if, for each graph __G__ in the class ${\cal C}$ of ${\cal F}$‐free graphs, every realiza

Signed graph factors and degree sequence

Signed graph factors and degree sequences

✍ Dean Hoffman; Heather Jordon 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB

## Abstract For a signed graph __G__ and function $f: V(G) \rightarrow Z$, a signed __f__‐factor of __G__ is a spanning subgraph __F__ such that sdeg~__F__~(__υ__) = __f__(__υ__) for every vertex __υ__ of __G__, where sdeg(__υ__) is the number of positive edges incident with __v__ less the number o

Light subgraphs in planar graphs of mini

Light subgraphs in planar graphs of minimum degree 4 and edge-degree 9

✍ B. Mohar; R. Škrekovski; H.-J. Voss 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 326 KB 👁 1 views

## Abstract A graph __H__ is light in a given class of graphs if there is a constant __w__ such that every graph of the class which has a subgraph isomorphic to __H__ also has a subgraph isomorphic to __H__ whose sum of degrees in __G__ is ≤ __w__. Let $\cal G$ be the class of simple planar graphs

Degree sequences of graphs and dominance

Degree sequences of graphs and dominance order

✍ Triesch, Eberhard 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 271 KB 👁 2 views

Suppose that the graphical partition H(A) = (a: 2 . . . 2 a:) arises from A = (al 2 . . . 2 a,) by deleting the largest summand a1 from A and reducing the a1 largest of the remaining summands by one. Let (a;+l 2 . . 2 ah) = H ( A ) denote the partition obtained by applying the operator H i times. We

Connected subgraphs with small degree su

Connected subgraphs with small degree sums in 3-connected planar graphs

✍ Enomoto, Hikoe; Ota, Katsuhiro 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 213 KB 👁 2 views

It is well-known that every planar graph has a vertex of degree at most five. Kotzig proved that every 3-connected planar graph has an edge xy such that deg(x) + deg(y) ≤ 13. In this article, considering a similar problem for the case of three or more vertices that induce a connected subgraph, we sh

Largest bipartite subgraphs in triangle-

Largest bipartite subgraphs in triangle-free graphs with maximum degree three

✍ J. A. Bondy; S. C. Locke 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 977 KB

Let G be a triangle-free, loopless graph with maximum degree three. We display a polynomi$ algorithm which returns a bipartite subgraph of G containing at least 5 of the edges of G. Furthermore, we characterize the dodecahedron and the Petersen graph as the only 3-regular, triangle-free, loopless, c