On Finding Constrained Independent Sets in Cycles
Author:
- 4 November 2023
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 86 (4) , 1006-1030
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Israel Science Foundation (1218/20)
This publication has 19 references indexed in Scilit:
- INTERSECTING FAMILIES OF SEPARATED SETSJournal of the London Mathematical Society, 2003
- Combinatorial NullstellensatzCombinatorics, Probability and Computing, 1999
- On the complexity of the parity argument and other inefficient proofs of existenceJournal of Computer and System Sciences, 1994
- The Hamiltonian property of consecutive-d digraphsMathematical and Computer Modelling, 1993
- Equivariant cohomology and lower bounds for chromatic numbersTransactions of the American Mathematical Society, 1992
- A solution to a colouring problem of P. ErdősDiscrete Mathematics, 1992
- The strong chromatic number of a graphRandom Structures & Algorithms, 1992
- Kneser's conjecture, chromatic number, and homotopyJournal of Combinatorial Theory, Series A, 1978
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETSThe Quarterly Journal of Mathematics, 1967
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETSThe Quarterly Journal of Mathematics, 1961