Journal of combinatorial theory. Series B
An algorithm for (n--3)-connectivity augmentation problem: Jump system approach
Kristóf Bérczi, Yusuke Kobayashi
págs. 565-587
Xujin Chen, Guoli Ding, Xingxing Yu, Wenan Zang
págs. 588-609
An upgraded Wheels-and-Whirls Theorem for 3-connected matroids
James Oxley, Charles Semple, Geoff Whittle
págs. 610-637
Cyclic orderings and cyclic arboricity of matroids
Jan van den Heuvel, Stéphan Thomassé
págs. 638-646
Decomposition of 3-connected representable matroids
Rong Chen, Kai-Nan Xiang
págs. 647-670
Tree-width of hypergraphs and surface duality
Frédéric Mazoit
págs. 671-687
Towards a splitter theorem for internally 4-connected binary matroids
Carolyn Chun, Dillon Mayhew, James Oxley
págs. 688-700
Decomposing locally semicomplete digraphs into strong spanning subdigraphs
Jorgen Bang-Jensen, Jing Huang
págs. 701-714
Minimum H-decompositions of graphs: Edge-critical case
Lale Ozkahya, Yury Person
págs. 715-725
John Engbers, David Galvin
págs. 726-742
The size Ramsey number of a directed path
Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov
págs. 743-755
Christian Joseph Altomare
págs. 756-759
Stability, fragility, and Rota's Conjecture
Dillon Mayhew, Geoff Whittle, Stefan H. M. van Zwam
págs. 760-783
Nonnegative k-sums, fractional covers, and probability of small deviations
Noga Alon, Hao Huang, Benny Sudakov
págs. 784-796
Bounding the size of a vertex-stabiliser in a finite vertex-transitive graph
Cheryl E. Praeger, Pablo Spiga, Gabriel Verret
págs. 797-819
On graph-restrictive permutation groups
Primoz Potocnik, Pablo Spiga, Gabriel Verret
págs. 820-831
págs. 832-838
- Página 1 de 1
