Avoidable paths in graphs

DOI10.37236/9030zbMath1454.05058arXiv1908.03788OpenAlexW3113066384MaRDI QIDQ2215468

Jocelyn Thiebaut, Meike Hatzel, Oscar Defrain, Marthe Bonamy

Publication date: 13 December 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.03788

zbMATH Keywords

avoidableavoidable path

Mathematics Subject Classification ID

Paths and cycles (05C38) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Shifting paths to avoidable ones, Computing and listing avoidable vertices and paths, Computing and listing avoidable vertices and paths, Avoidable vertices and edges in graphs: existence, characterization, and applications

Cites Work

• On rigid circuit graphs
• Separability generalizes Dirac's theorem
• Dirac-type characterizations of graphs without long chordless cycles
• Vertex elimination orderings for hereditary graph classes