Forbidden triples for 2-connected graphs with minimum degree three which contain K₄ and K₂,2

DOI10.20429/TAG.2025.120205MaRDI QIDQ6899501zbMATH OpenFDO

Authors Takafumi Kotani, Yoshimi Egawa

Publication date 14 November 2025

Published in Theory and Applications of Graphs (Search for Journal in Brave)

Full work available at URL https://doi.org/10.20429/TAG.2025.120205

zbMATH Keywords

forbidden subgraphsfinite undirected simple graphs

Mathematics Subject Classification ID

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

This page was built for publication: Forbidden triples for \(2\)-connected graphs with minimum degree three which contain \(K_4\) and \(K_{2,2}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6899501)