4.2 Article

Odd Induced Subgraphs in Planar Graphs with Large Girth

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Mathematics

VERTEX PARTITIONING OF GRAPHS INTO ODD

Arman Aashtab et al.

Summary: In this paper, we investigate the partition problem of connected graphs with even order, proving that for a connected subcubic graph or a connected planar graph with even order, the minimum number of odd induced subgraphs in the partition does not exceed 4. We also demonstrate that for a tree of even order, the minimum number of odd induced subgraphs does not exceed 2, and for a unicyclic graph of even order, it does not exceed 3. Additionally, we prove that if the graph is claw-free, the vertex set can be partitioned into at most |Δ(G)|-1 induced forests and possibly one independent set. Furthermore, we show that the vertex set of the line graph of a tree can be partitioned into at most two odd induced subgraphs and possibly one independent set.

DISCUSSIONES MATHEMATICAE GRAPH THEORY (2023)

Article Computer Science, Information Systems

Full friendly index sets of mCn

Yurong Ji et al.

Summary: This paper investigates the full friendly index set of a family of graphs, exploring the relationship between friendly vertex labeling and edge labeling functions.

FRONTIERS OF COMPUTER SCIENCE (2022)

Article Mathematics

Every graph contains a linearly sized induced subgraph with all degrees odd

Asaf Ferber et al.

Summary: This article proves an old and well-known conjecture in graph theory, stating that every graph with no isolated vertices contains an induced subgraph of size at least n/10000 with all degrees odd.

ADVANCES IN MATHEMATICS (2022)

Article Computer Science, Information Systems

VColor*: a practical approach for coloring large graphs

Yun Peng et al.

Summary: Graph coloring has broad applications in various fields, and our VColor and VColor* approaches address efficiency challenges in graph coloring. VColor* demonstrates superior efficiency compared to VColor in experimental evaluations.

FRONTIERS OF COMPUTER SCIENCE (2021)

Article Mathematics, Applied

A bound on judicious bipartitions of directed graphs

Jianfeng Hou et al.

SCIENCE CHINA-MATHEMATICS (2020)

Article Mathematics

On bipartitions of directed graphs with small semidegree

Jianfeng Hou et al.

EUROPEAN JOURNAL OF COMBINATORICS (2020)

Article Mathematics

Odd Induced Subgraphs in Graphs with Treewidth at Most Two

Xinmin Hou et al.

GRAPHS AND COMBINATORICS (2018)

Article Mathematics

On induced subgraphs with all degrees odd

AD Scott

GRAPHS AND COMBINATORICS (2001)