On the connectivity of graphs embedded in surfaces. II.
On a conjecture concerning the Petersen graph.
On a Family of Line-Critical Graphs.
Some recent results on domination in graphs
In this paper, we survey some new results in four areas of domination in graphs, namely: (1) the toughness and matching structure of graphs having domination number 3 and which are "critical" in the sense that if one adds any missing edge, the domination number falls to 2; (2) the matching structure of graphs having domination number 3 and which are "critical" in the sense that if one deletes any vertex, the domination number falls to 2; (3) upper bounds...
On the Point-Core of a Graph.
On a special case of Hadwiger's conjecture
Hadwiger's Conjecture seems difficult to attack, even in the very special case of graphs G of independence number α(G) = 2. We present some results in this special case.
Page 1