Graphs without dead ends

DOI10.1006/EUJC.1996.0006zbMATH Open0842.05028OpenAlexW2042384921MaRDI QIDQ1908274FDOQ1908274

Authors: G. Sabidussi 

Publication date: 17 July 1996

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1996.0006

Recommendations

• Graphs without spanning closed trails
• Ends of graphs
• scientific article; zbMATH DE number 6438262
• scientific article; zbMATH DE number 15461
• Graphs with no grid obstacle representation
• scientific article; zbMATH DE number 1933072
• Graphs without four-cycles
• Connected graphs without long paths
• Directed graphs without short cycles

zbMATH Keywords

distancedead endsantipodal graphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75)

Cited In (5)

• Graphs without spanning closed trails
• On some characterizations of antipodal partial cubes
• On antipodal and diametrical partial cubes
• A survey on the missing Moore graph
• On some properties of antipodal partial cubes

This page was built for publication: Graphs without dead ends

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908274)