Deficiency and Forbidden Subgraphs of Connected, Locally-Connected Graphs
A graph G is locally-connected if the neighbourhood NG(v) induces a connected subgraph for each vertex v in G. For a graph G, the deficiency of G is the number of vertices unsaturated by a maximum matching, denoted by def(G). In fact, the deficiency of a graph measures how far a maximum matching is...
Main Authors: | Li Xihe, Wang Ligong |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2020-02-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2121 |
Similar Items
-
Rainbow Vertex-Connection and Forbidden Subgraphs
by: Li Wenjing, et al.
Published: (2018-02-01) -
On Implicit Heavy Subgraphs and Hamiltonicity of 2-Connected Graphs
by: Zheng Wei, et al.
Published: (2021-02-01) -
The Minimum Size of a Graph with Given Tree Connectivity
by: Sun Yuefang, et al.
Published: (2021-05-01) -
Large Contractible Subgraphs of a 3-Connected Graph
by: Karpov Dmitri V.
Published: (2021-02-01) -
On Two Generalized Connectivities of Graphs
by: Sun Yuefang, et al.
Published: (2018-02-01)