scientific article; zbMATH DE number 2080244

MaRDI QIDQ4472489zbMATH OpenFDO

Authors Xiao Zhou, Takao Nishizeki

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1969/19690168.htm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1696542
• Completely independent spanning trees in (partial) \(k\)-trees
• A linear-time algorithm to find four independent spanning trees in four connected planar graphs
• scientific article; zbMATH DE number 1262807
• Independent trees in graphs

Cited in

(5)

• On independent spanning trees
• Finding totally independent spanning trees with linear integer programming
• Completely independent spanning trees in (partial) \(k\)-trees
• scientific article; zbMATH DE number 1696542 (Why is no real title available?)
• A linear-time algorithm to find four independent spanning trees in four connected planar graphs

This page was built for publication:

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