Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article; zbMATH DE number 1533074

From MaRDI portal
Publication:4518337
Jump to:navigation, search

DOI<128::AID-JGT6>3.0.CO;2-6 10.1002/1097-0118(200010)35:2<128::AID-JGT6>3.0.CO;2-6zbMath0960.05001MaRDI QIDQ4518337

Rudolf Halin

Publication date: 6 February 2001


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

problemsinfinite graphs


Mathematics Subject Classification ID

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


Related Items (10)

Quickly proving Diestel's normal spanning tree criterion ⋮ Proof of Halin's normal spanning tree conjecture ⋮ End‐faithful spanning trees in graphs without normal spanning trees ⋮ Halin's end degree conjecture ⋮ Minimal obstructions for normal spanning trees ⋮ A new obstruction for normal spanning trees ⋮ The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits ⋮ Locally finite graphs with ends: A topological approach. II: Applications ⋮ A note on graphs with countable automorphism group ⋮ On the cycle space of an infinite 3-connected graph



Cites Work

  • Minimization Problems for Infinite n-Connected Graphs


This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4518337&oldid=18625341"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 7 February 2024, at 08:59.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki