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

DOI10.1016/J.IPL.2013.04.008zbMATH Open1285.05029OpenAlexW2056996641WikidataQ122965297 ScholiaQ122965297MaRDI QIDQ2444762FDOQ2444762

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

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

zbMATH Keywords

spanning treesgraph algorithmsindependent treestree connectivity

Mathematics Subject Classification ID

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

Cites Work

• On independent spanning trees

Cited In (2)

• Edge-orders
• Four edge-independent spanning trees

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)