𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Scoring Criterion For Learning Chain Graphs

✍ Scribed by Zhong Guo Zheng; Jing Xu; Xing Wei Tong


Publisher
Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2005
Tongue
English
Weight
153 KB
Volume
22
Category
Article
ISSN
1439-7617

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A reduction criterion for supereulerian
✍ Catlin, Paul A. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 162 KB πŸ‘ 2 views

Let G be a graph, and let H be a connected subgraph of G. When it is known that the graph G/H (obtained from G by contracting H to a vertex) has a spanning eulerian subgraph, under what conditions can it be inferred that G itself has a spanning eulerian subgraph? 0 1996 John Wiley & Sons, Inc.

A criterion for the planarity of a graph
✍ Jerome R. Breitenbach πŸ“‚ Article πŸ“… 1986 πŸ› John Wiley and Sons 🌐 English βš– 146 KB πŸ‘ 1 views

In a recent paper, Carsten Thomassen [Carsten Thomassen, Planarity and duality of finite and infinite graphs. J. Combinatorial Theory Ser. B 29 (1980) 244-2711 has shown that a number of criteria for the planarity of a graph can be reduced to that of Kuratowski. Here we present another criterion whi

A new planarity criterion for 3-connecte
✍ Alexander K. Kelmans πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 474 KB πŸ‘ 1 views

## Abstract Direct proofs of some planarity criteria are presented.

A Criterion for the t-Vertex Condition o
✍ Sven Reichard πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 126 KB

Combining two concepts of regularity of graphs, namely k-isoregularity and the t-vertex condition, a generalization of a classical result by Hestenes and Higman is presented. As an application it is shown that two infinite series of graphs constructed by Brouwer, Ivanov, and Klin which are not rank