Work

Proof of a conjecture on connectivity keeping odd paths in k-connected bipartite graphs

Year: 2025

Type: article

Source: Discrete Mathematics

DOI: 10.1016/j.disc.2025.114476

Authors: Qing Yang, Yingzhi Tian

Institution: Xinjiang University

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

Funder: National Natural Science Foundation of China

Award: G2375593000

OpenAlex ID: W4408225534

FWCI: 0.961

Cites: 15

Cited by: 2

Related to: 10