Structural properties and hamiltonicity of neighborhood graphs

DOI10.1007/s00373-010-0909-xzbMath1258.05064OpenAlexW2073152987MaRDI QIDQ1959709

Hanns-Martin Teichert, Martin Sonntag, Ingo Schiermeyer

Publication date: 7 October 2010

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0909-x

zbMATH Keywords

connectivityneighborhood graphHamiltonicity

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

On neighborhood graphs: Domination, coloring and other properties ⋮ Iterated open neighborhood graphs and generalizations ⋮ Diameter of neighborhood graphs ⋮ Toughness, forbidden subgraphs and pancyclicity ⋮ On the radius of neighborhood graphs

Cites Work

• Interval competition graphs of symmetric digraphs
• Two-step graphs of trees
• A characterization of graphs with interval two-step graphs
• Chromatic numbers of competition graphs
• Pancyclic graphs. I
• Note on Hamilton Circuits
• Competition Graphs of Strongly Connected and Hamiltonian Digraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Structural properties and hamiltonicity of neighborhood graphs