Partition the vertices of a graph into one independent set and one acyclic set

被引：16

作者：

Yang, Aifeng ^{[1
]}

Yuan, Jinjiang

机构：

[1] Hefei Univ Technol, Sch Management, Hefei 230009, Anhui, Peoples R China

[2] Zhengzhou Univ, Dept Math, Zhengzhou 450052, Henan, Peoples R China

来源：

DISCRETE MATHEMATICS | 2006年 / 306卷 / 12期

关键词：

near-bipartition; acyclic set; independent set;

D O I：

10.1016/j.disc.2005.09.016

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

For a given graph G, if the vertices of G can be partitioned into an independent set and an acyclic set, then we call G a near-bipartite graph. This paper studies the recognition of near-bipartite graphs. We give simple characterizations for those near-bipartite graphs having maximum degree at most 3 and those having diameter 2. We also show that the recognition of near-bipartite graphs is NP-complete even for graphs where the maximum degree is 4 or where the diameter is 4. (c) 2006 Elsevier B.V. All rights reserved.

引用

页码：1207 / 1216

页数：10

共 50 条

[41] The Terwilliger Algebra Associated with a Set of Vertices in a Distance-Regular Graph
Hiroshi Suzuki
Journal of Algebraic Combinatorics, 2005, 22 : 5 - 38
[42] ON REALIZABILITY OF A SET OF INTEGERS AS DEGREES OF THE VERTICES OF A LINEAR GRAPH .1.
HAKIMI, SL
JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1962, 10 (03): : 496 - 506
[43] The Terwilliger algebra associated with a set of vertices in a distance-regular graph
Suzuki, H
JOURNAL OF ALGEBRAIC COMBINATORICS, 2005, 22 (01) : 5 - 38
[44] OPTIMAL PARTITIONING OF SET OF VERTICES OF A GRAPH BY REDUCTION TO A PROBLEM OF MAXIMAL CUT
ORLOVA, GI
DORFMAN, GY
ENGINEERING CYBERNETICS, 1975, 13 (03): : 44 - 50
[45] ONE2SET: Generating Diverse Keyphrases as a Set
Ye, Jiacheng
Gui, Tao
Luo, Yichao
Xu, Yige
Zhang, Qi
59TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS AND THE 11TH INTERNATIONAL JOINT CONFERENCE ON NATURAL LANGUAGE PROCESSING (ACL-IJCNLP 2021), VOL 1, 2021, : 4598 - 4608
[46] Partition the vertices of a graph into induced matchings
Yuan, JJ
Wang, Q
DISCRETE MATHEMATICS, 2003, 263 (1-3) : 323 - 329
[47] Partition Independent Set and Reduction-Based Approach for Partition Coloring Problem
Zhu, Enqiang
Jiang, Fei
Liu, Chanjuan
Xu, Jin
IEEE TRANSACTIONS ON CYBERNETICS, 2022, 52 (06) : 4960 - 4969
[48] THE PATH SET POLYTOPE OF AN ACYCLIC, DIRECTED GRAPH WITH AN APPLICATION TO MACHINE SEQUENCING
VATE, JHV
NETWORKS, 1989, 19 (05) : 607 - 614
[49] Interior vertices in set partitions
Mansour, Toufik
ADVANCES IN APPLIED MATHEMATICS, 2018, 101 : 60 - 69
[50] SQUARES WITH VERTICES IN A PRESCRIBED SET
BICK, TA
AMERICAN MATHEMATICAL MONTHLY, 1980, 87 (08): : 676 - 676

← 1 2 3 4 5 →