Modulo 5-orientations and degree sequences
Authors:
- Miaomiao HanMHMiaomiao Han
- Hong-Jian LaiHLHong-Jian Lai
- Jian-Bing LiuJLJian-Bing Liu
- 1 May 2019
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 260, 155-163
Abstract
No abstract availableKeywords
Funding Information
- Chinese National Natural Science Foundation (CNNSF 11771039, CNNSF 11771443)
This publication has 15 references indexed in Scilit:
- Realizing degree sequences as -connected graphsDiscrete Mathematics, 2014
- On strongly-connected graphsDiscrete Applied Mathematics, 2014
- A note on an extremal problem for group-connectivityEuropean Journal of Combinatorics, 2014
- Nowhere-zero 3-flows and modulo k-orientationsJournal of Combinatorial Theory, Series B, 2013
- Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-FlowsSIAM Journal on Discrete Mathematics, 2008
- Mod (2p + 1)-Orientations and $K_{1,2p+1}$-DecompositionsSIAM Journal on Discrete Mathematics, 2008
- Nowhere-Zero 4-Flows, Simultaneous Edge-Colorings, And Critical Partial Latin SquaresCombinatorica, 2004
- Line removal algorithms for graphs and their degree listsIEEE Transactions on Circuits and Systems, 1976
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. IJournal of the Society for Industrial and Applied Mathematics, 1962
- A Contribution to the Theory of Chromatic PolynomialsCanadian Journal of Mathematics, 1954