✦ LIBER ✦

A characterization of partially dual graphs

✍ Scribed by Iain Moffatt

Publisher: John Wiley and Sons
Year: 2010
Tongue: English
Weight: 332 KB
Volume: 67
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.20525

No coin nor oath required. For personal study only.

✦ Synopsis

In this article, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result generalizes a well-known result of J. Edmonds in which natural duality of graphs is characterized in terms of edge correspondence, and gives a combinatorial characterization of partial duality.

📜 SIMILAR VOLUMES

A Characterization of Half-Dual Polar Gr

A Characterization of Half-Dual Polar Graphs

✍ Tung-Shan Fu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 82 KB

The half-dual polar graphs are characterized among distance-regular graphs with all singular lines of constant size of at least three by their parameters and some extra conditions.

Partial characterizations of circular-ar

Partial characterizations of circular-arc graphs

✍ F. Bonomo; G. Durán; L.N. Grippo; M.D. Safe 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB

## Abstract A circular‐arc graph is the intersection graph of a family of arcs on a circle. A characterization by forbidden induced subgraphs for this class of graphs is not known, and in this work we present a partial result in this direction. We characterize circular‐arc graphs by a list of minim

Antidesigns and regularity of partial sp

Antidesigns and regularity of partial spreads in dual polar graphs

✍ Frédéric Vanhove 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB

We give several examples of designs and antidesigns in classical finite polar spaces. These types of subsets of maximal totally isotropic subspaces generalize the dualization of the concepts of m-ovoids and tight sets of points in generalized quadrangles. We also consider regularity of partial sprea

A characterization of Seymour graphs

✍ Ageev, A. A.; Kostochka, A. V.; Szigeti, Z. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB 👁 1 views

A connected undirected graph G is called a Seymour graph if the maximum number of edge disjoint T -cuts is equal to the cardinality of a minimum T -join for every even subset T of V (G). Several families of graphs have been shown to be subfamilies of Seymour graphs (Seymour

A characterization of ptolemaic graphs

✍ Edward Howorka 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 466 KB

A connected graph G is ptolernaic provided that for each four vertices u,, 1 5 i 5 4, of G, the six distances d, =dG (u,ui), i f j satisfy the inequality d,2d34 5 d,3d24 + d,4d23 (shown by Ptolemy t o hold in Euclidean spaces). Ptolemaic graphs were first investigated by Chartrand and Kay, who showe

A characterization of ?-outerplanar grap

A characterization of ?-outerplanar graphs

✍ Wargo, Lawrence 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 528 KB

Chartrand and Harary have shown that if G is a non-outerplanar graph such that, for every edge e, both the deletion G \ e and the contraction G/e of e from G are outerplanar, then G is isomorphic to K4 or K2,3. An a-outerplanar graph is a graph which is not outerplanar such that, for some edge a , b