scientific article; zbMATH DE number 1533074

DOI10.1002/1097-0118(200010)35:2%3C128::AID-JGT6%3E3.0.CO;2-6zbMATH Open0960.05001MaRDI QIDQ4518337FDOQ4518337

Authors: Rudolf Halin 

Publication date: 6 February 2001

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

zbMATH Keywords

infinite graphsproblems

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (05Cxx)

Cites Work

• Minimization Problems for Infinite n-Connected Graphs

Cited In (17)

• Quickly proving Diestel's normal spanning tree criterion
• The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits
• Proof of Halin's normal spanning tree conjecture
• A path Turán problem for infinite graphs
• Title not available (Why is that?)
• About the Gordian graph at infinity
• Minimal obstructions for normal spanning trees
• Locally finite graphs with ends: A topological approach. II: Applications
• A note on graphs with countable automorphism group
• Halin's end degree conjecture
• On the cycle space of an infinite 3-connected graph
• End‐faithful spanning trees in graphs without normal spanning trees
• Applications of Order Trees in Infinite Graphs
• A new obstruction for normal spanning trees
• Halin's end degree conjecture
• Title not available (Why is that?)
• The complexity of a class 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 Q4518337)