Cover Image

Tight cuts in matching covered graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lu, Fuliang, Dong, Fengming
Format:	Preprint
Published:	2026
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Removable edges in cubic matching covered graphs
by: Fuliang, Lu, et al.
Published: (2022)

Wheel-like bricks and minimal matching covered graphs
by: He, Xiaoling, et al.
Published: (2024)

Adjacent vertices of small degree in minimal matching covered graphs
by: He, Xiaoling, et al.
Published: (2026)

The number of perfect matchings in a brick
by: Lu, Fuliang, et al.
Published: (2024)

Nice vertices in cubic graphs
by: Chen, Wuxian, et al.
Published: (2025)

On minimal k-factor-critical planar graphs
by: Li, Qiuli, et al.
Published: (2025)

$θ$-free matching covered graphs
by: Joshi, Rohinee, et al.
Published: (2024)

Every 3-connected $\{K_{1,4},K_{1,4}+e\}$-free split graph of order at least 13 is Hamilton-connected
by: Tian, Tao, et al.
Published: (2026)

Planar wheel-like bricks
by: Lu, Fuliang, et al.
Published: (2024)

Extremal 1-planar graphs without k-cliques
by: Zhang, Licheng, et al.
Published: (2026)

A new infinite family of 4-regular crossing-critical graphs
by: Ding, Zongpeng, et al.
Published: (2024)

Extremal minimal bipartite matching covered graphs
by: Mallik, Amit Kumar, et al.
Published: (2024)

A study on $T$-equivalent graphs
by: Dong, Fengming, et al.
Published: (2025)

The minimum degree of minimal 2-extendable claw-free graphs
by: Guo, Jing, et al.
Published: (2025)

The density of maximal IC-plane graphs and maximal NIC-plane graphs
by: Ding, Zongpeng, et al.
Published: (2025)

4-connected 1-planar chordal graphs are Hamiltonian-connected
by: Zhang, Licheng, et al.
Published: (2024)

On covering cubic graphs with three perfect matchings
by: Máčajová, Edita, et al.
Published: (2025)

Cubic bricks that every b-invariant edge is forcing
by: Zhang, Yaxian, et al.
Published: (2024)

Claw-free minimal matching covered graphs
by: Zhang, Yipei, et al.
Published: (2024)

Rainbow matchings in edge-colored graphs
by: Lu, Hongliang, et al.
Published: (2025)

Determining the minimum size of maximal 1-plane graphs
by: Huang, Yuanqiu, et al.
Published: (2025)

Topology of total cut complexes and cut complexes of grid graphs
by: Chandrakar, Himanshu, et al.
Published: (2024)

Improved bounds on the $H$-rank of a mixed graph in terms of the matching number and fractional matching number
by: Wu, Qi, et al.
Published: (2025)

Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles
by: Le, Hoang-Oanh, et al.
Published: (2023)

Removable edges in near-bipartite bricks
by: Zhang, Yipei, et al.
Published: (2024)

Maximal and maximum induced matchings in connected graphs
by: Yuan, Bo-Jun, et al.
Published: (2024)

Partial domination of middle graphs
by: Zhang, Shumin, et al.
Published: (2025)

Turán number of complete bipartite graphs with bounded matching number
by: Luo, Huan, et al.
Published: (2024)

Equivalent spectral theory for fundamental graph cut problems
by: Shao, Sihong, et al.
Published: (2024)

The minimum degree of minimal $k$-factor-critical claw-free graphs*
by: Guo, Jing, et al.
Published: (2023)

Tight bounds for judicious 3-partitions of graphs
by: Kuang, Peiru, et al.
Published: (2025)

DP color functions versus chromatic polynomials for hypergraphs (I)
by: Cui, Ruiyi, et al.
Published: (2026)

Stability of large cuts in random graphs
by: Hoshen, Ilay, et al.
Published: (2024)

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

Lightning graph matching
by: shen, Binrui., et al.
Published: (2023)

Hamiltonicity of covering graphs of trees
by: Bradshaw, Peter, et al.
Published: (2022)

Extremal graphs for average size of maximal matchings in bicyclic graphs
by: Zhang, Kai
Published: (2026)

The minimum crossing number and minimum size of maximal 1-plane graphs with given connectivity
by: Ouyang, Zhangdong, et al.
Published: (2025)

Tightness of the weight-distribution bound for strongly regular polar graphs
by: Evans, Rhys J., et al.
Published: (2024)

Connected matching in graphs with independence number two
by: Chen, Rong, et al.
Published: (2024)