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

DOI10.1016/J.IPL.2013.04.008MaRDI QIDQ2444762zbMATH OpenOpenAlexWikidataFDO

Authors Abishek Gopalan, S. Ramasubramanian

Publication date 11 April 2014

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2013.04.008

zbMATH Keywords

spanning treesgraph algorithmsindependent treestree connectivity

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Recommendations

• Two counterexamples on completely independent spanning trees
• On independent spanning trees
• Constructing independent spanning trees for locally twisted cubes
• Disproof of a conjecture about independent branchings in k‐connected directed graphs
• Comments on: ``A Hamilton sufficient condition for completely independent spanning tree

Cites work

• On independent spanning trees

Cited in

(2)

• Four edge-independent spanning trees
• Edge-orders

This page was built for publication: A counterexample for the proof of implication conjecture on independent spanning trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2444762)