✦ LIBER ✦

Matched drawability of graph pairs and of graph triples

✍ Scribed by Luca Grilli; Seok-Hee Hong; Giuseppe Liotta; Henk Meijer; Stephen K. Wismath

Book ID: 108101009
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 751 KB
Volume: 43
Category: Article
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2010.03.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A polynomial transform for matching pair

A polynomial transform for matching pairs of weighted graphs

✍ H.A. Almohamad 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 679 KB

Niche graphs and mixed pair graphs of to

Niche graphs and mixed pair graphs of tournaments

✍ Bowser, Steve; Cable, Charles; Lundgren, Richard 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 339 KB 👁 2 views

In our efforts to study the niche graph of a tournament T , we have found it easier to study the complement, which we call the ''mixed pair'' graph of T and denote MP (T ). We show that an undirected graph G is MP (T ), for some tournament T , if and only if G is one of the following: a cycle of odd

Triple placement of graphs

✍ Mariusz Woźniak; A. Paweł Wojda 📂 Article 📅 1993 🏛 Springer Japan 🌐 English ⚖ 289 KB

Matching and symmetry of graphs

✍ Haruo Hosoya 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 809 KB

Disjoint matchings of graphs

✍ Kenneth Lebensold 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 250 KB

Graphs of Triangulations and Perfect Mat

Graphs of Triangulations and Perfect Matchings

✍ M.E. Houle; F. Hurtado; M. Noy; E. Rivera-Campo 📂 Article 📅 2005 🏛 Springer Japan 🌐 English ⚖ 139 KB