Forbidden triples generating a finite set of graphs with high connectivity
DOI10.17654/AM099030225zbMATH Open1430.05069OpenAlexW2887831531MaRDI QIDQ5207934FDOQ5207934
Authors: Zhixian Zhao 
Publication date: 14 January 2020
Published in: Far East Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.17654/am099030225
Recommendations
- Tree in forbidden triples generating a finite set of graphs with high connectivity
- Forbidden triples generating a finite set of 3-connected graphs
- Forbidden triples containing a complete graph and a complete bipartite graph of small order
- Forbidden triples involving the complete bipartite graph with partite sets having cardinalities two and three.
- Forbidden subgraphs generating a finite set
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Connectivity (05C40) Structural characterization of families of graphs (05C75)
Cites Work
- Graph theory
- Title not available (Why is that?)
- Forbidden subgraphs and the existence of a 2-factor
- Forbidden subgraphs generating a finite set
- The asymptotic connectivity of labelled regular graphs
- Forbidden triples generating a finite set of 3-connected graphs
- Forbidden triples containing a complete graph and a complete bipartite graph of small order
- \(r\)-regular \(r\)-connected graphs with large girth
- Forbidden triples involving the complete bipartite graph with partite sets having cardinalities two and three.
- Forbidden quadruplets generating a finite set of 2-connected graphs
Cited In (9)
- Forbidden quadruplets generating a finite set of 2-connected graphs
- Forbidden subgraphs generating almost the same sets
- Forbidden triples containing a complete graph and a complete bipartite graph of small order
- Tree in forbidden triples generating a finite set of graphs with high connectivity
- Forbidden triples involving the complete bipartite graph with partite sets having cardinalities two and three.
- Forbidden triples generating a finite set of graphs with minimum degree three
- Forbidden caterpillars for 3-connected graphs with girth at least five
- Forbidden subgraphs generating a finite set
- Forbidden triples generating a finite set of 3-connected graphs
This page was built for publication: Forbidden triples generating a finite set of graphs with high connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207934)
