✦ LIBER ✦

About colorings, stability and paths in directed graphs

✍ Scribed by Henry Meyniel

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 191 KB
Volume: 74
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90206-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Isomorphism Problem For Directed Pat

The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs

✍ L. Babel; I.N. Ponomarenko; G. Tinhofer 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 237 KB

This paper deals with the isomorphism problem of directed path graphs and rooted directed path graphs. Both graph classes belong to the class of chordal graphs, and for both classes the relative complexity of the isomorphism problem is yet unknown. We prove that deciding isomorphism of directed path

Vertex-disjoint paths and edge-disjoint

Vertex-disjoint paths and edge-disjoint branchings in directed graphs

✍ R. W. Whitty 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 482 KB

A theorem of J. Edmonds states that a directed graph has k edge-disjoint branchings rooted at a vertex r if and only if every vertex has k edge-disjoint paths to r . We conjecture an extension of this theorem to vertex-disjoint paths and give a constructive proof of the conjecture in the case k = 2.

Path homomorphisms, graph colorings, and

Path homomorphisms, graph colorings, and boolean matrices

✍ Jaroslav Nešetřil; Claude Tardif 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB

## Abstract We investigate bounds on the chromatic number of a graph __G__ derived from the nonexistence of homomorphisms from some path \documentclass{article}\footskip=0pc\pagestyle{empty}\begin{document}\begin{eqnarray\*}\vec{P}\end{eqnarray\*}\end{document} into some orientation \documentclass{

Recent problems and results about kernel

Recent problems and results about kernels in directed graphs

✍ C. Berge; P. Duchet 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 355 KB

In Section 1, we survey the existence theorems for a kernel; in Section 2, we discuss a new conjecture which could constitute a bridge between the kernel problems and the perfect graph conjecture. In fact, we believe that a graph is 'quasi-perfect' if and only if it is perfect. ## Proposition 1.1.

Reasoning about data with directed graph

Reasoning about data with directed graphs

✍ David Tritchler 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB

This paper constructs graphical models for two important analysis problems to demonstrate how graphs can clearly represent complex relationships. A powerful property of graphical models called d-separation describes the statistical associations in a given graphical model. This allows the e!ects of u

Paths in bipartite graphs with color-inv

Paths in bipartite graphs with color-inverting involutions

✍ Gert Sabidussi 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 681 KB

We consider connected bipartite graphs that have a color-inverting involution and do not contain an induced path of length 5. It is shown that such graphs have a color-preserving involution or a dominating edge, or else contain one of two simple forbidden subgraphs.