| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651085 | Discrete Mathematics | 2007 | 9 Pages |
Abstract
P4P4-sparse graphs (defined by Hoàng) and P4P4-reducible graphs (defined by Jamison and Olariu) are graphs with weak density of P4P4's. Weak-bisplit graphs are bipartite graphs which show some analogies with cographs (i.e. P4P4-free graphs) and are characterized with two forbidden configurations. We describe here bipartite graphs with weak density of those configurations. Structural properties and recognition algorithms are given.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jean-Luc Fouquet, Jean-Marie Vanherpe,