scientific article; zbMATH DE number 19211

zbMATH Open0742.05063MaRDI QIDQ3976641FDOQ3976641

Authors: J. Sheehan, C. R. J. Clapham 

Publication date: 26 June 1992

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

Recommendations

• Almost every tree with \(n\) edges decomposes \(K_{2n,2n}\)
• Almost every tree with \(m\) edges decomposes \(K_{2m,2m}\)
• Trees with equal 2-domination and 2-independence numbers
• All trees contain a large induced subgraph having all degrees 1 (mod \(k\))
• Trees with equal domination and tree-free domination numbers
• scientific article; zbMATH DE number 3935064
• scientific article; zbMATH DE number 1161337
• \(\{0, 2 \}\)-degree free spanning forests in graphs
• Spanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-free graphs
• Almost all trees have an even number of independent sets

zbMATH Keywords

tree\(k\)-free graph

Mathematics Subject Classification ID

Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cited In (7)

• All trees are 1-embeddable and all except stars are 2-embeddable
• Title not available (Why is that?)
• Title not available (Why is that?)
• Almost every tree with \(n\) edges decomposes \(K_{2n,2n}\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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