Bipartite subgraphs of graphs with maximum degree three

被引：7
|
作者：
Bylka, SA [1 ]
Idzik, A [1 ]
Komar, J [1 ]
机构：
[1] Polish Acad Sci, Inst Comp Sci, PL-02137 Warsaw, Poland
来源：
GRAPHS AND COMBINATORICS | 1999年 / 15卷 / 02期
关键词：
bipartite graph; n-colourable graph; extremal graph;
D O I：
10.1007/s003730050047
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We prove that for a connected graph G with maximum degree 3 there exists a bipartite subgraph of G containing almost 3/4 of the edges of G. Furthermore, we completely characterize the set of all extremal graphs, i.e. all connected graphs G = (V, E) with maximum degree 3 for which no bipartite subgraph has more than 3 \E\ - 1/4 of the edges; \E\ denotes the cardinality of E. For 2-edge-connected graphs there are two kinds of extremal graphs which realize the lower bound 3/4 \E\.
引用
收藏
页码：129 / 136
页数：8
相关论文
共 50 条
  • [41] On bipartite graphs with weak density of some subgraphs
    Fouquet, Jean-Luc
    Vanherpe, Jean-Marie
    DISCRETE MATHEMATICS, 2007, 307 (11-12) : 1516 - 1524
  • [42] Labeling outerplanar graphs with maximum degree three
    Li, Xiangwen
    Zhou, Sanming
    DISCRETE APPLIED MATHEMATICS, 2013, 161 (1-2) : 200 - 211
  • [43] The firefighter problem for graphs of maximum degree three
    Finbow, Stephen
    King, Andrew
    MacGillivray, Gary
    Rizzi, Romeo
    DISCRETE MATHEMATICS, 2007, 307 (16) : 2094 - 2105
  • [44] The independence number in graphs of maximum degree three
    Harant, Jochen
    Henning, Michael A.
    Rautenbach, Dieter
    Schiermeyer, Ingo
    DISCRETE MATHEMATICS, 2008, 308 (23) : 5829 - 5833
  • [45] Disjoint subgraphs of large maximum degree
    Pikhurko, O
    Thomason, A
    DISCRETE MATHEMATICS, 2002, 248 (1-3) : 125 - 141
  • [46] Degree Distance in Graphs with Forbidden Subgraphs
    Mafuta, Phillip
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2023, 90 (03) : 685 - 707
  • [47] Maximum planar subgraphs in dense graphs
    Allen, Peter
    Skokan, Jozef
    Wuerfl, Andreas
    ELECTRONIC JOURNAL OF COMBINATORICS, 2013, 20 (03):
  • [48] Maximum chordal subgraphs of random graphs
    Krivelevich, Michael
    Zhukovskii, Maksim
    COMBINATORICS PROBABILITY AND COMPUTING, 2024, 33 (05) : 611 - 623
  • [49] 2-Connected spanning subgraphs with low maximum degree in locally planar graphs
    Ellingham, M. N.
    Kawarabayashi, Ken-ichi
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2007, 97 (03) : 401 - 412
  • [50] A NOTE ON BIPARTITE SUBGRAPHS OF TRIANGLE-FREE GRAPHS
    SHEARER, JB
    RANDOM STRUCTURES & ALGORITHMS, 1992, 3 (02) : 223 - 226
12345