scientific article; zbMATH DE number 1117456

DOI10.1002/(SICI)1097-0118(199712)26:4%3C175::AID-JGT1%3E3.0.CO;2-NMaRDI QIDQ4376492zbMATH OpenFDO

Authors Norbert Polat

Publication date 11 February 1998

Full work available at URL https://doi.org/10.1002/(SICI)1097-0118(199712)26:4%3C175::AID-JGT1%3E3.0.CO;2-N

zbMATH Keywords

end-faithful spanning treeends

Mathematics Subject Classification ID

Trees (05C05)

Recommendations

• On end-faithful spanning trees in infinite graphs
• On spanning trees and k-connectedness in infinite graphs
• A refinement of Halin's end-faithful spanning tree theorem
• End-faithful forests and spanning trees in infinite graphs

Cited in

(8)

• End-faithful forests and spanning trees in infinite graphs
• The depth-first search tree structure of \(TK_{\aleph_ 0}\)-free graphs
• A refinement of Halin's end-faithful spanning tree theorem
• On end-faithful spanning trees in infinite graphs
• End-Faithful Spanning Trees of Countable Graphs with Prescribed Sets of Rays
• Duality theorems for stars and combs III: Undominated combs
• End‐faithful spanning trees in graphs without normal spanning trees
• A representation theorem for end spaces of infinite 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 Q4376492)