Forbidden Subgraphs and Weak Locally Connected Graphs
Forbidden Subgraphs and Weak Locally Connected Graphs is a scholarly work, published in 2018 in ''Graphs and Combinatorics''. The main subjects of the publication include connected component of a graph, mesh generation, induced subgraph, graph, combinatorics, k-vertex-connected graph, graph theory, graph connectivity measure, distance-hereditary graph, node, discrete mathematics, Network On Chip, mathematics, and induced subgraph isomorphism problem. The authors present an algorithm to find a collapsible subgraph of a graph with girth 4 whose idea is used to prove the authors' first conclusion above.