Traceability in graphs with forbidden triples of subgraphs
From MaRDI portal
Publication:1584364
DOI10.1016/S0012-365X(97)00249-5zbMATH Open0956.05065OpenAlexW1996184244WikidataQ127931431 ScholiaQ127931431MaRDI QIDQ1584364FDOQ1584364
Authors: Ronald Gould, John M. Harris 
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
Recommendations
- scientific article; zbMATH DE number 1185328
- Traceability in \(\{K_{1,4},K_{1,4}+e\}\)-free graphs.
- Forbidden triples and traceability: A characterization
- Forbidden triples containing a complete graph and a complete bipartite graph of small order
- Forbidden pairs of disconnected graphs for traceability in connected graphs
Cites Work
Cited In (12)
- Forbidden induced subgraphs for star-free graphs
- Title not available (Why is that?)
- Forbidden triples and traceability: A characterization
- Forbidden pairs of disconnected graphs excepting claw for traceability of block-chains.
- Forbidden set of induced subgraphs for 2-connected supereulerian graphs
- Pairs of forbidden induced subgraphs for homogeneously traceable graphs
- Forbidden subgraph pairs for traceability of block-chains
- Ramsey-type results for path covers and path partitions. II: Digraphs
- On the existence of \(F\)-strong trace of a graph when \(F\) induces a forest
- Forbidden pairs of disconnected graphs for traceability in connected graphs
- Ramsey-type results for path covers and path partitions
- Forbidden triples for perfect matchings
This page was built for publication: Traceability in graphs with forbidden triples of subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584364)
