Image de couverture de livre

Tight cuts in matching covered graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Lu, Fuliang, Dong, Fengming
Format:	Preprint
Publié:	2026
Sujets:	Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Removable edges in cubic matching covered graphs
par: Fuliang, Lu, et autres
Publié: (2022)

Wheel-like bricks and minimal matching covered graphs
par: He, Xiaoling, et autres
Publié: (2024)

Adjacent vertices of small degree in minimal matching covered graphs
par: He, Xiaoling, et autres
Publié: (2026)

The number of perfect matchings in a brick
par: Lu, Fuliang, et autres
Publié: (2024)

Nice vertices in cubic graphs
par: Chen, Wuxian, et autres
Publié: (2025)

On minimal k-factor-critical planar graphs
par: Li, Qiuli, et autres
Publié: (2025)

$θ$-free matching covered graphs
par: Joshi, Rohinee, et autres
Publié: (2024)

Every 3-connected $\{K_{1,4},K_{1,4}+e\}$-free split graph of order at least 13 is Hamilton-connected
par: Tian, Tao, et autres
Publié: (2026)

Planar wheel-like bricks
par: Lu, Fuliang, et autres
Publié: (2024)

Extremal 1-planar graphs without k-cliques
par: Zhang, Licheng, et autres
Publié: (2026)

A new infinite family of 4-regular crossing-critical graphs
par: Ding, Zongpeng, et autres
Publié: (2024)

Extremal minimal bipartite matching covered graphs
par: Mallik, Amit Kumar, et autres
Publié: (2024)

A study on $T$-equivalent graphs
par: Dong, Fengming, et autres
Publié: (2025)

The minimum degree of minimal 2-extendable claw-free graphs
par: Guo, Jing, et autres
Publié: (2025)

The density of maximal IC-plane graphs and maximal NIC-plane graphs
par: Ding, Zongpeng, et autres
Publié: (2025)

4-connected 1-planar chordal graphs are Hamiltonian-connected
par: Zhang, Licheng, et autres
Publié: (2024)

On covering cubic graphs with three perfect matchings
par: Máčajová, Edita, et autres
Publié: (2025)

Cubic bricks that every b-invariant edge is forcing
par: Zhang, Yaxian, et autres
Publié: (2024)

Claw-free minimal matching covered graphs
par: Zhang, Yipei, et autres
Publié: (2024)

Rainbow matchings in edge-colored graphs
par: Lu, Hongliang, et autres
Publié: (2025)

Determining the minimum size of maximal 1-plane graphs
par: Huang, Yuanqiu, et autres
Publié: (2025)

Topology of total cut complexes and cut complexes of grid graphs
par: Chandrakar, Himanshu, et autres
Publié: (2024)

Improved bounds on the $H$-rank of a mixed graph in terms of the matching number and fractional matching number
par: Wu, Qi, et autres
Publié: (2025)

Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles
par: Le, Hoang-Oanh, et autres
Publié: (2023)

Removable edges in near-bipartite bricks
par: Zhang, Yipei, et autres
Publié: (2024)

Maximal and maximum induced matchings in connected graphs
par: Yuan, Bo-Jun, et autres
Publié: (2024)

Partial domination of middle graphs
par: Zhang, Shumin, et autres
Publié: (2025)

Turán number of complete bipartite graphs with bounded matching number
par: Luo, Huan, et autres
Publié: (2024)

Equivalent spectral theory for fundamental graph cut problems
par: Shao, Sihong, et autres
Publié: (2024)

The minimum degree of minimal $k$-factor-critical claw-free graphs*
par: Guo, Jing, et autres
Publié: (2023)

Tight bounds for judicious 3-partitions of graphs
par: Kuang, Peiru, et autres
Publié: (2025)

DP color functions versus chromatic polynomials for hypergraphs (I)
par: Cui, Ruiyi, et autres
Publié: (2026)

Stability of large cuts in random graphs
par: Hoshen, Ilay, et autres
Publié: (2024)

On the Zagreb indices of the line graph and line cut-vertex graph of subdivision of unicyclic graphs
par: Nagesh, H. M.
Publié: (2024)

Lightning graph matching
par: shen, Binrui., et autres
Publié: (2023)

Hamiltonicity of covering graphs of trees
par: Bradshaw, Peter, et autres
Publié: (2022)

Extremal graphs for average size of maximal matchings in bicyclic graphs
par: Zhang, Kai
Publié: (2026)

The minimum crossing number and minimum size of maximal 1-plane graphs with given connectivity
par: Ouyang, Zhangdong, et autres
Publié: (2025)

Tightness of the weight-distribution bound for strongly regular polar graphs
par: Evans, Rhys J., et autres
Publié: (2024)

Connected matching in graphs with independence number two
par: Chen, Rong, et autres
Publié: (2024)