2000 character limit reached
A characterization on $(g,f)$-parity orientations (2404.04797v1)
Published 7 Apr 2024 in math.CO
Abstract: Let $G$ be a graph and $g,f:V(G)\to2N$ be two set functions such that $g(v)\le f(v)$ and $g(v)\equiv f(v)\pmod 2$ for every $v\in V(G)$. An orientation $O$ of $G$ is called a $(g,f)$-parity orientation if $g(v)\le d+_O(v)\le f(v)$ and $g(v)\equiv d+_O(v)\pmod 2$ for every $v\in V(G)$. In this paper, we give a Tutte-type characterization for a graph to have a $(g,f)$-parity orientation.
Sponsored by Paperpile, the PDF & BibTeX manager trusted by top AI labs.
Get 30 days freePaper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.