Disproof of a conjecture about independent branchings in k‐connected directed graphs

DOI10.1002/JGT.3190200212MaRDI QIDQ4852408zbMATH OpenOpenAlexWikidataFDO

Authors Andreas Huck

Publication date 11 March 1996

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190200212

zbMATH Keywords

conjecture of Frankdirected graphsindependent branchingspathspanning tree

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38)

Recommendations

• On Frank's conjecture on \(k\)-connected orientations
• Highly connected infinite digraphs without edge-disjoint back and forth paths between a certain vertex pair
• Vertex-disjoint paths and edge-disjoint branchings in directed graphs
• Independent arborescences in directed graphs
• Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2

Cites work

• Independent branchings in acyclic digraphs

Cited in

(12)

• Independent branchings in acyclic digraphs
• A multi-tree routing scheme using acyclic orientations
• Disproof of a conjecture on the existence of the path-recursive period for a connected graph
• Disjoint paths in arborescences
• Independent arborescences in directed graphs
• On Frank's conjecture on \(k\)-connected orientations
• A counterexample for the proof of implication conjecture on independent spanning trees
• Miscellaneous digraph classes
• Highly connected infinite digraphs without edge-disjoint back and forth paths between a certain vertex pair
• Independent spanning trees with small depths in iterated line digraphs
• Improved upper bound on the Frank number of 3-edge-connected graphs
• Spanning trees: A survey

This page was built for publication: Disproof of a conjecture about independent branchings in k‐connected directed graphs

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