scientific article; zbMATH DE number 4008429

From MaRDI portal
Publication:3758862





[For the entire collection see Zbl 0619.00006.] Given a connected cubic graph of order n, Payan, Tchuente and Yuong have shown that G contains a spanning tree with at least n/4 vertices of degree 3. They conjecture that n/4 can be replaced by n/3 if G contains no \(K_ 4-e\). We prove that if G has no triangles, then it has a spanning tree with \(\lfloor n/3\rfloor\) vertices of degree 3.











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 Q3758862)