𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Even and odd pairs in linegraphs of bipartite graphs

✍ Scribed by Stefan Hougardy

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
291 KB
Volume
16
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Even and odd holes in cap-free graphs
Even and odd holes in cap-free graphs
✍ Conforti, Michele; CornuοΏ½jols, GοΏ½rard; Kapoor, Ajai; Vu?kovi?, Kristina πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 158 KB πŸ‘ 1 views

It is an old problem in graph theory to test whether a graph contains a chordless cycle of length greater than three (hole) with a specific parity (even, odd). Studying the structure of graphs without odd holes has obvious implications for Berge's strong perfect graph conjecture that states that a g

Bipartite graphs with cycles of all even
Bipartite graphs with cycles of all even lengths
✍ Edward Schmeichel; John Mitchem πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 428 KB πŸ‘ 1 views

## Abstract Let __G__ = (__X, Y, E__) be a bipartite graph with __X__ = __Y__ = __n__. ChvΓ‘tal gave a condition on the vertex degrees of __X__ and __Y__ which implies that __G__ contains a Hamiltonian cycle. It is proved here that this condition also implies that __G__ contains cycles of every even

K4-free graphs with no odd hole: Even pa
K4-free graphs with no odd hole: Even pairs and the circular chromatic number
✍ Yori Zwols πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 219 KB

An odd hole in a graph is an induced cycle of odd length at least five. In this article we show that every imperfect K 4 -free graph with no odd hole either is one of two basic graphs, or has an even pair or a clique cutset. We use this result to show that every K 4 -free graph with no odd hole has

Even and Odd Pairs of Lattice Paths with
Even and Odd Pairs of Lattice Paths with Multiple Intersections
✍ Ira M. Gessel; Walter Shur πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 345 KB

We study the numbers M n, k r, s , N n, r k =M n, k r, r , N E (n, k, p), and N O (n, k, p), prove several simple relations among them, and derive a simpler formula for M n, k r, s than appears in .

On the -optimality in graphs with odd gi
On the -optimality in graphs with odd girth and even girth
✍ C. Balbuena; P. GarcΓ­a-VΓ‘zquez; L.P. Montejano; J. Salas πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 222 KB

## a b s t r a c t For a connected graph G, the restricted edge-connectivity Ξ» β€² (G) is defined as the minimum cardinality of an edge-cut over all edge-cuts S such that there are no isolated vertices in }, d(u) denoting the degree of a vertex u. The main result of this paper is that graphs with od