Traceability in graphs with forbidden triples of subgraphs

DOI10.1016/S0012-365X(97)00249-5zbMath0956.05065OpenAlexW1996184244WikidataQ127931431 ScholiaQ127931431MaRDI QIDQ1584364

John M. Harris, Ronald J. Gould

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00249-5

zbMATH Keywords

traceabilityforbidden subgraphstriples of subgraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45)

Related Items (6)

Forbidden set of induced subgraphs for 2-connected supereulerian graphs ⋮ Ramsey-type results for path covers and path partitions. II: Digraphs ⋮ Forbidden induced subgraphs for star-free graphs ⋮ Forbidden triples for perfect matchings ⋮ Forbidden triples and traceability: A characterization ⋮ Ramsey-type results for path covers and path partitions

Cites Work

• Forbidden triples and traceability: A characterization
• Characterizing forbidden pairs for hamiltonian properties
• On Representatives of Subsets
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Traceability in graphs with forbidden triples of subgraphs