×

zbMATH — the first resource for mathematics

Constructing full spanning trees for cubic graphs. (English) Zbl 0482.05031

MSC:
05C05 Trees
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Even, S., Graph algorithms, (1979), Computer Science Press Potomac, MD · Zbl 0441.68072
[2] Garey, M.R.; Johnson, D.S., Computers and intractability: A guide to the theory of NP-completeness, (1979), Freeman San Francisco, CA · Zbl 0411.68039
[3] Papadimitriou, C.H.; Yannakakis, M., (), 460-470
[4] Yannakakis, M., Private communication, (1979)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.