384 search results - page 17 / 77 » On s-hamiltonian-connected line graphs |
DM
2007
13 years 8 months ago
2007
The binary codes of the line graphs Lm(n) of the complete multipartite graphs Kn1,...,nm (ni = n for 1 ≤ i ≤ m) n ≥ 2, m ≥ 3 are examined, and PD-sets and s-PD-sets are fo...
ISAAC
2010
Springer
13 years 6 months ago
2010
Springer
A permutation graph is an intersection graph of segments lying between two parallel lines. A Seidel complementation of a finite graph at a vertex v consists in complementing the ed...
DM
2007
13 years 8 months ago
2007
By Petersen’s theorem, a bridgeless cubic multigraph has a 2-factor. H. Fleischner generalised this result to bridgeless multigraphs of minimum degree at least three by showing ...
BIRTHDAY
2010
Springer
13 years 9 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
JGT
2007
13 years 8 months ago
2007
Let G be a simple graph with order n and minimum degree at least two. In this paper, we prove that if every odd branch-bond in G has an edge-branch, then its line graph has a 2-fa...