Forbidden triples and traceability: A characterization

DOI10.1016/S0012-365X(99)00021-7zbMath0935.05079OpenAlexW2109252973MaRDI QIDQ1301658

John M. Harris, Ronald J. Gould

Publication date: 4 May 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00021-7

zbMATH Keywords

characterizationconnected graphtraceabilityfamilies of forbidden subgraphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45)

Related Items (8)

Forbidden set of induced subgraphs for 2-connected supereulerian graphs ⋮ Forbidden subgraphs and the existence of a spanning tree without small degree stems ⋮ Ramsey-type results for path covers and path partitions. II: Digraphs ⋮ Forbidden induced subgraphs for star-free graphs ⋮ Forbidden triples for perfect matchings ⋮ Traceability in graphs with forbidden triples of subgraphs ⋮ Ramsey-type results for path covers and path partitions ⋮ Minimal forbidden sets for degree sequence characterizations

Cites Work

• Characterizing forbidden pairs for hamiltonian properties
• Traceability in graphs with forbidden triples of subgraphs
• Hamiltonian results inK1,3-free graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Forbidden triples and traceability: A characterization