1 citations · 1 across the 6 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.CO2026
Tight cuts in matching covered graphs
Fuliang Lu, Fengming Dong
An edge cut C of a graph G is tight if |C \M| = 1 for every perfect matching M of G. Barrier-cuts and 2-separation cuts, also referred to as ELP-cuts, are two important types of ti…
math.CO2026
Extremal 1-planar graphs without k-cliques
Licheng Zhang, Yuanqiu Huang, Fengming Dong
In 2016, Dowden initiated the study of planar Turán-type problems, which has since attracted considerable attention. Recently, Bekos et al. proved that every -free -planar…