Concepedia

Author

P. Katerinis

Goldsmiths University of London

Also Known As

P Katerinis, P. KATERINIS, P. Katerinis, Panagiotis Katerinis

27

Publications

374

Citations

9

H-Index

11

Concepts

All Affiliations

Goldsmiths University of LondonAthens University of Economics and Business
PK

About

P. Katerinis is an author at Goldsmiths University of London specializing in discrete mathematics, graph theory, and education.

Top Concepts

#ConceptH-IndexPublicationsCitations

1

Education

5

5

247

2

Engineering

2

2

47

3

Combinatorial Optimization

2

2

47

4

Factor Analysis

2

2

173

5

Computational Complexity

1

1

37

P. Katerinis

×

9

Publications

346

Citations

9

H-Index

YearCitations

Toughness and the existence of <i>k</i>‐factors

Hikoe Enomoto, Bill Jackson, P. Katerinis,

Journal of Graph Theory

1985

154

BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF <i>k</i>-FACTORS

P. Katerinis, Douglas R. Woodall

The Quarterly Journal of Mathematics

1987

48

Toughness of graphs and the existence of factors

P. Katerinis

Discrete Mathematics

1990

37

Minimum degree of a graph and the existence ofk-factors

P. Katerinis

Proceedings of the Indian Academy of Sciences - Section A

1985

35

Some conditions for the existence of <i>f</i>‐factors

P. Katerinis

Journal of Graph Theory

1985

19

The existence of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-factors in squares of graphs

Olga Fourtounelli, P. Katerinis

Discrete Mathematics

2010

16

Two sufficient conditions for a 2‐factor in a bipartite graph

P. Katerinis

Journal of Graph Theory

1987

15

Regular factors in regular graphs

P. Katerinis

Discrete Mathematics

1993

12

Maximum matchings in a regular graph of specified connectivity and bounded order

P. Katerinis

Journal of Graph Theory

1987

10

Page 1