✦ LIBER ✦

Rectangular matrix models and combinatorics of colored graphs

✍ Scribed by P. Di Francesco

Book ID: 117554537
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 804 KB
Volume: 648
Category: Article
ISSN: 0550-3213
DOI: 10.1016/s0550-3213(02)00900-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graphs with full rank 3-color matrix and

Graphs with full rank 3-color matrix and few 3-colorings

✍ Serguei Norine; Jean-Sébastien Sereni 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 69 KB

Matrix models and graph colouring

✍ Giovanni M. Cicuta; Luca Molinari; Emilio Montaldi 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 317 KB

Matrix integration and combinatorics of

Matrix integration and combinatorics of modular groups

✍ C. Itzykson; J. -B. Zuber 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 436 KB

Matrix graphs and bipartite graphs

✍ Wai-kai Chen 📂 Article 📅 1965 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 262 KB

Rectangular duals of planar graphs

✍ Krzysztof Koźmiński; Edwin Kinnen 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 645 KB

Characterization of edge-colored complet

Characterization of edge-colored complete graphs with properly colored Hamilton paths

✍ Jinfeng Feng; Hans-Erik Giesen; Yubao Guo; Gregory Gutin; Tommy Jensen; Arash Ra 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 164 KB

## Abstract An edge‐colored graph __H__ is properly colored if no two adjacent edges of __H__ have the same color. In 1997, J. Bang‐Jensen and G. Gutin conjectured that an edge‐colored complete graph __G__ has a properly colored Hamilton path if and only if __G__ has a spanning subgraph consisting