Toughness and (a,b)-parity factors in graphs

In this paper, we consider (a,b)- parity factors in graphs and obtain a toughness condition for the existence of (a,b)-parity factors. Furthermore, we show that the result is sharp in some sense.

Authors

Publication Details

Journal
Journal of Combinatorial Mathematics and Combinatorial Computing
Published
2025-09-28
DOI
https://doi.org/10.61091/jcmcc127-12
Primary Topic
Graph Labeling and Dimension Problems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Toughness and (a,b)-parity factors in graphs

Qiuju Bian
Journal of Combinatorial Mathematics and Combinatorial Computing
Graph Labeling and Dimension Problems
article

Toughness and (a,b)-parity factors in graphs

Qiuju Bian
article en

Abstract

In this paper, we consider (a,b)- parity factors in graphs and obtain a toughness condition for the existence of (a,b)-parity factors. Furthermore, we show that the result is sharp in some sense.

Journal of Combinatorial Mathematics and Combinatorial ComputingVol. 127
Openalex Percentile: Top 72%
Graph Labeling and Dimension Problems
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Toughness and (a,b)-parity factors in graphs — Qiuju Bian · Journal of Combinatorial Mathematics and Combinatorial Computing (2025) | TGRS Research Map | TGRS