𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On splitting the Clebsch graph

✍ Scribed by R.W. Goldbach; H.L. Claasen

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
390 KB
Volume
5
Category
Article
ISSN
0019-3577

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

High-girth cubic graphs are homomorphic
High-girth cubic graphs are homomorphic to the Clebsch graph
✍ Matt DeVos; Robert Ε Γ‘mal πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 192 KB

We give a (computer assisted) proof that the edges of every graph with maximum degree 3 and girth at least 17 may be 5-colored (possibly improperly) so that the complement of each color class is bipartite. Equivalently, every such graph admits a homomorphism to the Clebsch graph (Fig. 1). Hopkins an

On clique partitions of split graphs
On clique partitions of split graphs
✍ W.D. Wallis; J. Wu πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 204 KB

Wallis, W.D. and J. Wu, On clique partitions of split graphs, Discrete Mathematics 92 (1991) 427-429. Split graphs are graphs formed by taking a complete graph and an empty graph disjoint from it and some or all of the possible edges joining the two. We prove that the problem of deciding the clique

A note on Hamiltonian split graphs
A note on Hamiltonian split graphs
✍ Rainer E Burkard; Peter L Hammer πŸ“‚ Article πŸ“… 1980 πŸ› Elsevier Science 🌐 English βš– 230 KB
The toughness of split graphs
The toughness of split graphs
✍ Gerhard J. Woeginger πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 117 KB

In this short note we argue that the toughness of split graphs can be computed in polynomial time.