✦ LIBER ✦

A Characteristic Approach to Bipartite Graphs and Incidence Graphs

✍ Scribed by Terry A. McKee

Book ID: 108497959
Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 314 KB
Volume: 11
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00092-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Moments and characteristic polynomials o

Moments and characteristic polynomials of bipartite Hückel graphs

✍ Y. Jiang; H. Zhang 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 858 KB

Enumeration of Matchings in the Incidenc

Enumeration of Matchings in the Incidence Graphs of Complete and Complete Bipartite Graphs

✍ Pippenger, Nicholas 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 185 KB

Contracting chordal graphs and bipartite

Contracting chordal graphs and bipartite graphs to paths and trees

✍ Heggernes, Pinar; van ’t Hof, Pim; Lévêque, Benjamin; Paul, Christophe 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 384 KB

How to make a graph bipartite

✍ Paul Erdös; Ralph Faudree; János Pach; Joel Spencer 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 678 KB

Recommendation as link prediction in bip

Recommendation as link prediction in bipartite graphs: A graph kernel-based machine learning approach

✍ Xin Li; Hsinchun Chen 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 584 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