Traceability in graphs with forbidden triples of subgraphs
From MaRDI portal
Publication:1584364
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
- scientific article; zbMATH DE number 1185328 (Why is no real title available?)
- scientific article; zbMATH DE number 3730183 (Why is no real title available?)
- scientific article; zbMATH DE number 42739 (Why is no real title available?)
- Characterizing forbidden pairs for hamiltonian properties
- Forbidden triples and traceability: A characterization
- On Representatives of Subsets
Cited in
(12)- Forbidden triples for perfect matchings
- Forbidden induced subgraphs for star-free graphs
- scientific article; zbMATH DE number 1185328 (Why is no real title available?)
- Forbidden triples and traceability: A characterization
- Forbidden set of induced subgraphs for 2-connected supereulerian graphs
- Forbidden pairs of disconnected graphs excepting claw for traceability of block-chains.
- 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
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)
