Avoidability beyond paths

DOI10.37236/13023MaRDI QIDQ6977165zbMATH OpenFDO

Authors Vladimir Gurvich, Matjaž Krnc, Martin Milanič, Mikhail Vyalyi

Publication date 30 May 2025

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

zbMATH Keywords

induced subgraphinduced pathtwo-rooted graphavoidable pathavoidable two-rooted graphinherent two-rooted graphlimits of graph sequencestwo-rooted tree

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Paths and cycles (05C38) Infinite graphs (05C63) Structural characterization of families of graphs (05C75)

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 2149408 (Why is no real title available?)
• scientific article; zbMATH DE number 830463 (Why is no real title available?)
• scientific article; zbMATH DE number 3189017 (Why is no real title available?)
• Algorithmic Aspects of Vertex Elimination on Graphs
• Avoidable paths in graphs
• Avoidable vertices and edges in graphs
• Avoidable vertices and edges in graphs: existence, characterization, and applications
• Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs
• Dirac-type characterizations of graphs without long chordless cycles
• Dynamic cage survey
• Graph extremities defined by search algorithms
• Handbook of product graphs
• Maximum cardinality search for computing minimal triangulations of graphs
• Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
• On rigid circuit graphs
• Separability generalizes Dirac's theorem
• Shifting paths to avoidable ones

Cited in

(1)

• Growing trees and amoebas' replications

This page was built for publication: Avoidability beyond paths

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