Maximum Bisections of Graphs Without Adjacent Quadrilaterals

被引：0
|
作者：
Hu, Qiming [1 ]
Xu, Baogang [1 ]
机构：
[1] Nanjing Normal Univ, Inst Math, Sch Math Sci, 1 Wenyuan Rd, Nanjing 210023, Peoples R China
来源：
GRAPHS AND COMBINATORICS | 2025年 / 41卷 / 01期
基金：
中国国家自然科学基金;
关键词：
Bipartition; Bisection; C-6-free graphs; BIPARTITE SUBGRAPHS;
D O I：
10.1007/s00373-025-02889-7
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Let Ck be a cycle of length k . Let G be a graph with n vertices, m edges. Lin and Zeng proved that if G has a perfect matching and does not contain C-4 , C-6 and C-2k , then G admits a bisection of size at least m|2 + c(k)m((2k+1)/(2k+2)) and showed that the bound is tight for k E { 3 , 5}. In this paper, we obtain a similar tight result by replacing C-4 with two adjacent C-4's.
引用
收藏
页数：29
相关论文
共 50 条
  • [31] A note on bisections of graphs with girth at least 6
    Lin, Jing
    ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2019, (42): : 80 - 87
  • [32] Planar Graphs of Maximum Degree 6 and without Adjacent 8-Cycles Are 6-Edge-Colorable
    Zhang, Wenwen
    JOURNAL OF MATHEMATICS, 2021, 2021
  • [33] Random Walks, Bisections and Gossiping in Circulant Graphs
    Mans, Bernard
    Shparlinski, Igor
    ALGORITHMICA, 2014, 70 (02) : 301 - 325
  • [34] Random Walks, Bisections and Gossiping in Circulant Graphs
    Bernard Mans
    Igor Shparlinski
    Algorithmica, 2014, 70 : 301 - 325
  • [35] (Δ+1)-total-colorability of plane graphs with maximum degree Δ at least 6 and without adjacent short cycles
    Zhang, Jingwen
    Wang, Yingqian
    INFORMATION PROCESSING LETTERS, 2010, 110 (18-19) : 830 - 834
  • [36] Random Walks and Bisections in Random Circulant Graphs
    Mans, Bernard
    Shparlinski, Igor E.
    LATIN 2012: THEORETICAL INFORMATICS, 2012, 7256 : 542 - 555
  • [37] On 3-Bisections in Cubic and Subcubic Graphs
    Davide Mattiolo
    Giuseppe Mazzuoccolo
    Graphs and Combinatorics, 2021, 37 : 743 - 746
  • [38] Total colorings of planar graphs without adjacent triangles
    Sun, Xiang-Yong
    Wu, Jian-Liang
    Wu, Yu-Wen
    Hou, Han-Feng
    DISCRETE MATHEMATICS, 2009, 309 (01) : 202 - 206
  • [39] Planar graphs without normally adjacent short cycles
    Lu, Fangyao
    Rao, Mengjiao
    Wang, Qianqian
    Wang, Tao
    DISCRETE MATHEMATICS, 2022, 345 (10)
  • [40] Total Colorings of Planar Graphs with Maximum Degree Seven and without 3-Cycles Adjacent to 5-Cycles
    Liu, Guangde
    Wang, Bing
    Wu, Jian-liang
    FOUNDATIONS OF INTELLIGENT SYSTEMS (ISKE 2011), 2011, 122 : 335 - +
12345