𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs

✍ Scribed by Steen A. Andersson; David Madigan; Michael D. Perlman

Book ID
108535959
Publisher
John Wiley and Sons
Year
1997
Tongue
English
Weight
469 KB
Volume
24
Category
Article
ISSN
0303-6898

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the acyclic choosability of graphs
On the acyclic choosability of graphs
✍ MickaΓ«l Montassier; Pascal Ochem; AndrΓ© Raspaud πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 348 KB

## Abstract A proper vertex coloring of a graph __G__ =  (__V,E__) is acyclic if __G__ contains no bicolored cycle. A graph __G__ is __L__‐list colorable if for a given list assignment __L__ = {L(__v__): __v__β€‰βˆˆ __V__}, there exists a proper coloring __c__ of __G__ such that __c__ (__v__)β€‰βˆˆβ€‰__L__(_

On the distance connectivity of graphs a
On the distance connectivity of graphs and digraphs
✍ M.A. Fiol; J. FΓ brega πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 475 KB

Let G=( V, E) be a digraph with diameter D # 1. For a given integer 1 t. The t-distance edge-connectivity of G is defined analogously. This paper studies some results on the distance connectivities of digraphs and bipartite digraphs. These results are given in terms of the parameter I, which can be