𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A counterexample for the proof of implication conjecture on independent spanning trees

✍ Scribed by Gopalan, Abishek; Ramasubramanian, Srinivasan

Book ID
125452603
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
168 KB
Volume
113
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A computational attack on the conjecture
A computational attack on the conjectures of Graffiti: New counterexamples and proofs
✍ Tony L. Brewster; Michael J. Dinneen; Vance Faber πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 788 KB

Graffiti is a computer program that checks for relationships among certain graph invariants. It uses a database of graphs and has generated well over 700 conjectures. Having obtained a readily available computer tape of all the nonisomorphic graphs with 10 or fewer vertices, we have tested approxima

The independence number condition for th
The independence number condition for the existence of a spanning f-tree
✍ Hikoe Enomoto; Kenta Ozeki πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 123 KB πŸ‘ 1 views

## Abstract Let __G__ be a graph and __f__ be a mapping from __V__(__G__) to the positive integers. A subgraph __T__ of __G__ is called an __f__‐tree if __T__ forms a tree and __d__~__T__~(__x__)≀__f__(__x__) for any __x__∈__V__(__T__). We propose a conjecture on the existence of a spanning __f__‐t