scientific article; zbMATH DE number 125494

MaRDI QIDQ4027196zbMATH OpenFDO

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

Publication date 21 February 1993

zbMATH Keywords

edge-reconstructiontreestwo-free trees

Mathematics Subject Classification ID

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

Recommendations

• Trees with distinguishing number two
• The 2-dimension of a tree
• Trees with 2-reinforcement number three
• Trees whose 2-domination subdivision number is 2
• Two-graphs and trees
• Trees whose double domination number is twice their domination number
• Graph Drawing
• Two trees which are self-intersecting when drawn simultaneously
• Two-step graphs of trees
• The specification of 2-trees

Cited in

(3)

• A note on the edge-reconstruction of \(K_{1,m}\)-free graphs
• scientific article; zbMATH DE number 68355 (Why is no real title available?)
• All trees are 1-embeddable and all except stars are 2-embeddable

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