J.-C. Bermond - Concepedia

Author

J.-C. Bermond

Université Paris-Sud

Also Known As

Bermond, Jean-Claude, J. C. Bermond, J.-C Bermond, J.-C. Bermond, J.‐C. BERMOND, Jean-Claude Bermond

Publications

738

Citations

H-Index

Concepts

All Affiliations

Université Paris-Sud Laboratoire de Recherche en Informatique Université Paris Cité Centre National de la Recherche Scientifique Philips (Belgium)

About

J.-C. Bermond is an author at Université Paris-Sud specializing in graph theory, discrete mathematics, and engineering.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	6	6	429
2	Education	3	3	227
3	Medicine	1	1	14
4	Anatomy	1	1	14
5	Computer Engineering	1	1	154

J.-C. Bermond

Publications

602

Citations

H-Index

Page 1

	Year	Citations
Cycles in digraphs– a survey J.-C. Bermond, Carsten Thomassen Journal of Graph Theory Directed GraphNetwork ScienceGraph TheoryEngineeringExtremal Graph Theory	1981	198
Strategies for interconnection networks: Some methods from graph theory J.-C. Bermond, Charles Delorme, J.-J. Quisquater Journal of Parallel and Distributed Computing EngineeringNetwork ScienceGraph TheoryComputer EngineeringNetwork Analysis	1986	154
Hamiltonian decomposition of Cayley graphs of degree 4 J.-C. Bermond, Odile Favaron, Maryvonne Mahéo Journal of Combinatorial Theory Series B Graph TheoryAlgebraic Graph TheoryTopological Graph TheoryHamiltonian DecompositionExtremal Graph Theory	1989	132
Tables of large graphs wh given degree and diameter J.-C. Bermond, Charles Delorme, Jean-Jacques Quisquater Information Processing Letters Geometric Graph TheoryNetwork ScienceGraph TheoryEngineeringExtremal Graph Theory	1982	31
Existence of Resolvable Path Designs J.-C. Bermond, Katherine Heinrich, Min‐Li Yu European Journal of Combinatorics Mathematical ProgrammingPath PlanningEngineeringResolvable Path DesignsReachability Problem	1990	20
Table of large (Δ,D)-graphs J.-C. Bermond, Charles Delorme, Jean-Jacques Quisquater Discrete Applied Mathematics Network ScienceGraph TheoryStructural Graph TheoryPlanar GraphEducation	1992	17
Girth in digraphs J.-C. Bermond, Anne Germa, Marie-Claude Heydemann, Journal of Graph Theory Circuit ComplexityDirected GraphGeometric Graph TheoryLength KGraph Theory	1980	14
On a Conjecture of Chvátal on <i>m</i>-Intersecting Hypergraphs J.-C. Bermond, Péter Frankl Bulletin of the London Mathematical Society	1977	13
Longest paths in digraphs J.-C. Bermond, A. Germa, Marie-Claude Heydemann, COMBINATORICA Directed GraphGeometric Graph TheoryNetwork ScienceGraph TheoryEngineering	1981	12
Induced Subgraphs of the Power of a Cycle J.-C. Bermond, Claudine Peyrat SIAM Journal on Discrete Mathematics Induced SubgraphGraph MinorGeometric Graph TheoryDth PowerGraph Theory	1989	11

Page 1