Annals of Discrete Mathematics (27): Cycles in Graphs - North-Holland Mathematics Studies
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Elsevier

9780444878038

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A Counterexample to a Conjecture about Oriented Graphs

Annals of Discrete Mathematics (27): Cycles in Graphs - North-Holland Mathematics Studies ◽

10.1016/s0304-0208(08)73017-2 ◽

1985 ◽

pp. 235-236

Author(s):

Luis Goddyn

Keyword(s):

Oriented Graphs

Download Full-text

An Optimal Algorithm for Directing Triple Systems Using Eulerian Circuits

Annals of Discrete Mathematics (27): Cycles in Graphs - North-Holland Mathematics Studies ◽

10.1016/s0304-0208(08)73034-2 ◽

1985 ◽

pp. 433-438

Author(s):

Janelle J. Harms ◽

Charles J. Colbourn

Keyword(s):

Optimal Algorithm ◽

Triple Systems

Download Full-text

First Occurrence of Hamilton Cycles in Random Graphs

Annals of Discrete Mathematics (27): Cycles in Graphs - North-Holland Mathematics Studies ◽

10.1016/s0304-0208(08)73007-x ◽

1985 ◽

pp. 173-178 ◽

Cited By ~ 16

Author(s):

M. Ajtai ◽

J. Komlós ◽

E. Szeraerédi

Keyword(s):

Random Graphs ◽

Hamilton Cycles ◽

First Occurrence

Download Full-text

Copyright page

Annals of Discrete Mathematics (27): Cycles in Graphs - North-Holland Mathematics Studies ◽

10.1016/s0304-0208(08)72991-8 ◽

1985 ◽

pp. iv

Download Full-text

Unsolved Problems

Annals of Discrete Mathematics (27): Cycles in Graphs - North-Holland Mathematics Studies ◽

10.1016/s0304-0208(08)73038-x ◽

1985 ◽

pp. 461-467 ◽

Cited By ~ 1

Download Full-text

The Reconstruction Conjecture for Balanced Signed Graphs

Annals of Discrete Mathematics (27): Cycles in Graphs - North-Holland Mathematics Studies ◽

10.1016/s0304-0208(08)73035-4 ◽

1985 ◽

pp. 439-442

Author(s):

Frank Harary

Keyword(s):

Signed Graphs

Download Full-text

Cycle Basis Interpolation Theorems

Annals of Discrete Mathematics (27): Cycles in Graphs - North-Holland Mathematics Studies ◽

10.1016/s0304-0208(08)73030-5 ◽

1985 ◽

pp. 369-379 ◽

Cited By ~ 1

Author(s):

Frank Harary ◽

Elzbieta Kolasinska ◽

Maciej M. Sysło

Keyword(s):

Cycle Basis

Download Full-text

Some Hamiltonian Cayley Graphs

Annals of Discrete Mathematics (27): Cycles in Graphs - North-Holland Mathematics Studies ◽

10.1016/s0304-0208(08)73002-0 ◽

1985 ◽

pp. 129-140 ◽

Cited By ~ 1

Author(s):

David L. Powers

Keyword(s):

Cayley Graphs

Download Full-text

The Computational Complexity of Decomposing Block Designs

Annals of Discrete Mathematics (27): Cycles in Graphs - North-Holland Mathematics Studies ◽

10.1016/s0304-0208(08)73027-5 ◽

1985 ◽

pp. 345-350

Author(s):

Charles J. Colbourn ◽

Marlene J. Colbourn

Keyword(s):

Computational Complexity ◽

Block Designs

Download Full-text

A Short Proof of Rubin's Block Theorem

Annals of Discrete Mathematics (27): Cycles in Graphs - North-Holland Mathematics Studies ◽

10.1016/s0304-0208(08)73029-9 ◽

1985 ◽

pp. 367-368 ◽

Cited By ~ 2

Author(s):

R.C. Entringer

Keyword(s):

Short Proof

Download Full-text

Annals of Discrete Mathematics (27): Cycles in Graphs - North-Holland Mathematics StudiesLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Elsevier

A Counterexample to a Conjecture about Oriented Graphs

An Optimal Algorithm for Directing Triple Systems Using Eulerian Circuits

First Occurrence of Hamilton Cycles in Random Graphs

Copyright page

Unsolved Problems

The Reconstruction Conjecture for Balanced Signed Graphs

Cycle Basis Interpolation Theorems

Some Hamiltonian Cayley Graphs

The Computational Complexity of Decomposing Block Designs

A Short Proof of Rubin's Block Theorem

Annals of Discrete Mathematics (27): Cycles in Graphs - North-Holland Mathematics Studies
Latest Publications