๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Couplings, coupling networks and their graphs

โœ Scribed by T.H. Davies

Book ID
113229901
Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
648 KB
Volume
30
Category
Article
ISSN
0094-114X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Perfect couples of graphs
Perfect couples of graphs
โœ Jรกnos Kรถrner; Gรกbor Simonyi; Zsolt Tuza ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 662 KB
Cross-intersecting couples of graphs
Cross-intersecting couples of graphs
โœ Emanuela Fachini; Jรกnos Kรถrner ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 134 KB

## Abstract Two graphs on the same vertex set form a crossโ€intersecting couple if they have a pair of clique coverings with the property that every pair of cliques from the respective coverings intersect. In particular, a graph is called normal if it forms a crossโ€intersecting couple with its compl

Coupled choosability of plane graphs
Coupled choosability of plane graphs
โœ Weifan Wang; Ko-Wei Lih ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 197 KB

## Abstract A plane graph __G__ is coupled __k__โ€choosable if, for any list assignment __L__ satisfying $|{{L}}({{x}})|= {{k}}$ for every ${{x}}\in {{V}}({{G}})\cup {{F}}({{G}})$, there is a coloring that assigns to each vertex and each face a color from its list such that any two adjacent or incid