Degree sequence conditions for maximally edge-connected graphs depending on the clique number.

Peter Dankelmann Lutz Volkmann

Published in: Discret. Math. (2000)

Keyphrases

computational complexity
small number
connected graphs
information systems
mobile robot
higher order
memory requirements
fixed number