A characterization on $(g,f)$-parity orientations
Combinatorics
2024-04-09 v1
Abstract
Let be a graph and be two set functions such that and for every . An orientation of is called a -parity orientation if and for every . In this paper, we give a Tutte-type characterization for a graph to have a -parity orientation.
Cite
@article{arxiv.2404.04797,
title = {A characterization on $(g,f)$-parity orientations},
author = {Hongliang Lu and Xinxin Ma},
journal= {arXiv preprint arXiv:2404.04797},
year = {2024}
}