Twins of rayless graphs

12 years 12 months ago

Download www.math.ryerson.ca

Two non-isomorphic graphs are twins if each is isomorphic to a subgraph of the other. We prove that a rayless graph has either inﬁnitely many twins or none.

Anthony Bonato, Henning Bruhn, Reinhard Diestel, P

Real-time Traffic

JCT 2011 | Non-isomorphic Graphs | Rayless Graph | Twins |

claim paper

» Block duplicate graphs and a hierarchy of chordal graphs

» Structural Properties of TwinFree Graphs

» Frequent Subgraph Mining on Edge Weighted Graphs

» Improved Induced Matchings in Sparse Graphs

» Structure and lineartime recognition of 4leaf powers

» Connectivity oracles for failure prone graphs

» FixedParameter Enumerability of Cluster Editing and Related Problems

Post Info
More Details (n/a)

Added	14 May 2011
Updated	14 May 2011
Type	Journal
Year	2011
Where	JCT
Authors	Anthony Bonato, Henning Bruhn, Reinhard Diestel, Philipp Sprüssel

Comments (0)

Sciweavers

Twins of rayless graphs

JCT 2011 | Non-isomorphic Graphs | Rayless Graph | Twins |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers