FORBIDDEN TRIPLES GENERATING A FINITE SET OF GRAPHS WITH HIGH CONNECTIVITY

DOI10.17654/AM099030225zbMath1430.05069OpenAlexW2887831531MaRDI QIDQ5207934

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

zbMATH Keywords

forbidden subgraph\(k\)-connected graphforbidden triple

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Tree in forbidden triples generating a finite set of graphs with high connectivity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Forbidden subgraphs generating a finite set
• Forbidden triples containing a complete graph and a complete bipartite graph of small order
• The asymptotic connectivity of labelled regular graphs
• Forbidden quadruplets generating a finite set of 2-connected graphs
• Forbidden triples generating a finite set of 3-connected graphs
• Graph Theory
• Forbidden subgraphs and the existence of a 2-factor

This page was built for publication: FORBIDDEN TRIPLES GENERATING A FINITE SET OF GRAPHS WITH HIGH CONNECTIVITY