scientific article; zbMATH DE number 2080244

zbMATH Open1044.68711MaRDI QIDQ4472489FDOQ4472489

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

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

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

Cited In (5)

• Finding totally independent spanning trees with linear integer programming
• Title not available (Why is that?)
• On independent spanning trees
• Completely independent spanning trees in (partial) \(k\)-trees
• 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)