A forbidden pair for quasi 5-contractible edges
Shuai Kou, Weihua Yang, Mingzu Zhang, Shuang Zhao

TL;DR
This paper identifies a specific forbidden pair of graphs, K4 and P5, that characterize quasi 5-contractible edges in quasi 5-connected graphs, advancing understanding of graph contraction properties.
Contribution
The paper proves that K4 and P5 form a forbidden pair for quasi 5-contractible edges, providing a new characterization in graph theory.
Findings
K4 and P5 are the forbidden pair.
Characterization of quasi 5-contractible edges.
Advances understanding of graph contraction constraints.
Abstract
An edge of a quasi -connected graph is said to be quasi -contractible if the contraction of the edge results in a quasi -connected graph. If every quasi -connected graph without a quasi -contractible edge has either or as a subgraph, then an unordered pair of graphs is said to be a forbidden pair for quasi -contractible edges. We prove that is a forbidden pair for quasi 5-contractible edges, where is the graph obtained from by removing just one edge and is the complement of a path on five vertices.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInterconnection Networks and Systems · Advanced Graph Theory Research · Graph Labeling and Dimension Problems
