![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Article
Properties of Chip-Firing Games on Complete Graphs
Björner, Lovász and Shor introduced a chip-firing game on a finite graph \(G\) ...
-
Article
On Cyclic Edge-Connectivity and Super-Cyclic Edge-Connectivity of Double-Orbit Graphs
A cyclic edge-cut of a graph G is an edge set, the removal of which separates two cycles. If G has a cyclic edge-cut, then it is said to be cyclically separable. For a cyclically separable graph G, the cyclic edg...
-
Article
Non-Hamiltonian Graphs with Large Minimum Degree
An n-vertex graph G is called Hamiltonian if it contains a cycle of length n. Denote by \(\delta (G)\) ...