On partitions of -free graphs under degree constraints
Authors:
- Jianfeng HouJHJianfeng Hou
- Huawen MaHMHuawen Ma
- Jiguo YuJYJiguo Yu
- Xia ZhangXZXia Zhang
- 1 December 2018
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 341 (12) , 3288-3295
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (11671087)
This publication has 16 references indexed in Scilit:
- Bipartitions of oriented graphsJournal of Combinatorial Theory, Series B, 2018
- Bisections of Graphs Without Short CyclesCombinatorics, Probability and Computing, 2017
- Judicious Partitioning of Hypergraphs with Edges of Size at Most 2Combinatorics, Probability and Computing, 2016
- On judicious partitions of uniform hypergraphsJournal of Combinatorial Theory, Series A, 2016
- Bounds for pairs in judicious partitioning of graphsRandom Structures & Algorithms, 2016
- Problems and results on judicious partitionsRandom Structures & Algorithms, 2002
- Decomposing graphs with girth at least five under degree constraintsJournal of Graph Theory, 2000
- Exact Bounds for Judicious Partitions of GraphsCombinatorica, 1999
- On decomposition of triangle-free graphs under degree constraintsJournal of Graph Theory, 1998
- Some Extremal Properties of Bipartite SubgraphsCanadian Journal of Mathematics, 1973