✦ LIBER ✦

Interval incidence coloring of bipartite graphs

✍ Scribed by Janczewski, Robert; Małafiejska, Anna; Małafiejski, Michał

Book ID: 121506817
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 498 KB
Volume: 166
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.10.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Interval incidence graph coloring

✍ Janczewski, Robert; Małafiejska, Anna; Małafiejski, Michał 📂 Article 📅 2015 🏛 Elsevier Science 🌐 English ⚖ 433 KB

Edge-Coloring Bipartite Graphs

✍ Ajai Kapoor; Romeo Rizzi 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 65 KB

Given a bipartite graph G with n nodes, m edges, and maximum degree ⌬, we Ž . find an edge-coloring for G using ⌬ colors in time T q O m log ⌬ , where T is the time needed to find a perfect matching in a k-regular bipartite graph with Ž . O m edges and k F ⌬. Together with best known bounds for T th

Balanced coloring of bipartite graphs

✍ Uriel Feige; Shimon Kogan 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB

## Abstract Given a bipartite graph __G__(__U__∪__V, E__) with __n__ vertices on each side, an independent set __I__∈__G__ such that |__U__∩__I__|=|__V__∩__I__| is called a balanced bipartite independent set. A balanced coloring of __G__ is a coloring of the vertices of __G__ such that each color c

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

Edge coloring nearly bipartite graphs

✍ Bruce Reed 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 77 KB

Star coloring bipartite planar graphs

✍ H. A. Kierstead; André Kündgen; Craig Timmons 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB

## Abstract A __star coloring__ of a graph is a proper vertex‐coloring such that no path on four vertices is 2‐colored. We prove that the vertices of every bipartite planar graph can be star colored from lists of size 14, and we give an example of a bipartite planar graph that requires at least eig