On Forcibly k-Connected Uniform Hypergraphic Sequences
- 1 November 2023
- journal article
- research article
- Published by Springer Nature in Journal of the Operations Research Society of China
- Vol. 13 (4) , 1205-1215
Abstract
No abstract availableKeywords
Funding Information
- Natural Science Foundation of Xinjiang Uygur Autonomous Region (2020D04046)
- National Natural Science Foundation of China (11261086)
This publication has 16 references indexed in Scilit:
- Sufficient Conditions for Maximally Edge-Connected HypergraphsJournal of the Operations Research Society of China, 2018
- Sufficient conditions for hypergraphs to be maximally edge-connectedApplied Mathematics and Computation, 2018
- Connectivity in HypergraphsCanadian Mathematical Bulletin, 2018
- Degree sequences and edge connectivityAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 2017
- Maximally edge-connected hypergraphsDiscrete Mathematics, 2016
- Sufficient degree conditions for k‐edge‐connectedness of a graphNetworks, 2009
- The strongest monotone degree condition for n-connectedness of a graphJournal of Combinatorial Theory, Series B, 1974
- On Hamilton's idealsJournal of Combinatorial Theory, Series B, 1972
- Hamiltonian arcs and circuits1971
- Some Theorems on Abstract GraphsProceedings of the London Mathematical Society, 1952