Distributing vertices along a Hamiltonian cycle in Dirac graphs
Authors:
- Gábor N. SárközyGSGábor N. Sárközy
- Stanley SelkowSSStanley Selkow
- 1 December 2008
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 308 (23) , 5757-5770
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- On the number of Hamiltonian cycles in Dirac graphsDiscrete Mathematics, 2003
- Proof of the Alon–Yuster conjectureDiscrete Mathematics, 2001
- On a Hamiltonian Cycle in Which Specified Vertices Are Uniformly DistributedJournal of Combinatorial Theory, Series B, 2001
- Perfect Matchings in ϵ-Regular Graphs and the Blow-Up LemmaCombinatorica, 1999
- On the P sa-Seymour conjectureJournal of Graph Theory, 1998
- Blow-up LemmaCombinatorica, 1997
- On the square of a Hamiltonian cycle in dense graphsRandom Structures & Algorithms, 1996
- On circuits in graphsDiscrete Mathematics, 1984
- Graph decomposition: A new key to coding theoremsIEEE Transactions on Information Theory, 1981
- Subgraphs with prescribed valenciesJournal of Combinatorial Theory, 1970