✦ LIBER ✦

Canonical Antichains of Unit Interval and Bipartite Permutation Graphs

✍ Scribed by Vadim V. Lozin; Colin Mayhill

Publisher: Springer Netherlands
Year: 2010
Tongue: English
Weight: 268 KB
Volume: 28
Category: Article
ISSN: 0167-8094
DOI: 10.1007/s11083-010-9188-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tree 3-spanners on interval, permutation

Tree 3-spanners on interval, permutation and regular bipartite graphs

✍ M.S. Madanlal; G. Venkatesan; C.Pandu Rangan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 481 KB

Efficient algorithms for computing the r

Efficient algorithms for computing the reliability of permutation and interval graphs

✍ Hosam M. Aboeifotoh; Charles J. Colbourn 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 782 KB

Interval coloring of (3,4)-biregular bip

Interval coloring of (3,4)-biregular bipartite graphs having large cubic subgraphs

✍ A. V. Pyatkin 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 80 KB

## Abstract An interval coloring of a graph is a proper edge coloring such that the set of used colors at every vertex is an interval of integers. Generally, it is an NP‐hard problem to decide whether a graph has an interval coloring or not. A bipartite graph __G__ = (__A__,__B__;__E__) is (α, β)‐b