Completely independent spanning trees in split graphs: structural properties and complexity

DOI10.1016/J.DAM.2026.05.028MaRDI QIDQ7289263zbMATH OpenFDO

Authors M. Lalou, Nader Mbarek, Abdallah Skender, Olivier Togni

Publication date 2 July 2026

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2026.05.028

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Cites work

• A Hamilton sufficient condition for completely independent spanning tree
• Color-critical graphs and hypergraphs with few edges: a survey
• Completely independent spanning trees in (partial) \(k\)-trees
• Completely independent spanning trees in the underlying graph of a line digraph
• Completely independent spanning trees in torus networks
• Degree conditions for completely independent spanning trees of bipartite graphs
• Dirac's condition for completely independent spanning trees
• Fan-type condition for two completely independent spanning trees
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1953097 (Why is no real title available?)
• Ore's condition for completely independent spanning trees
• The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
• Two completely independent spanning trees of split graphs
• Two counterexamples on completely independent spanning trees

This page was built for publication: Completely independent spanning trees in split graphs: structural properties and complexity

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