An analogue of the Whithey theorem for edge graphs of multigraphs, and edge multigraphs

  title={An analogue of the Whithey theorem for edge graphs of multigraphs, and edge multigraphs},
  author={I. Zverovich},
We deduce an analogue of the Whitney theorem for the edge graphs of multigraphs. We introduce and investigate edge multigraphs as well. 
5 Citations

Figures from this paper

Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
A closure concept that turns a claw-free graph into the line graph of a multigraph while preserving its (non-)Hamilton-connectedness is introduced, and it is proved that the closure operation is, in a sense, best possible. Expand
On 1-Hamilton-connected claw-free graphs
It is proved that (i)every 5-connected claw-free graph with minimum degree at least 6 is 1-Hamilton-connected, and (ii)every 4-connected claws-free hourglass-freegraph is 1 -hamiltonian. Expand
On Forbidden Pairs Implying Hamilton-Connectedness
It is shown that every 3-connected -free graph is Hamilton connected for and or N1, 2, 2 and the proof of this result uses a new closure technique developed by the third and fourth authors. Expand
InstaHide's Sample Complexity When Mixing Two Private Images
It is shown that it suffices to use O(n_{\mathsf{priv}} - 2/(k-2/3) + 1) samples to recover one private image in O(k-1) time for any integer $k, where n and n denote the number of images used in the private and the public dataset to generate a mixed image sample. Expand


Congruent Graphs and the Connectivity of Graphs
We give here conditions that two graphs be congruent and some theorems on the connectivity of graphs, and we conclude with some applications to dual graphs. These last theorems might also be provedExpand
Graphe representatif des arretes d'un rnuitigraphe
  • J: Math. Pures et Appl
  • 1973
Graph theory
Derived graphs and digraphs
  • Beitrage zur Graphentheorie. Leipzig, 1968, pp.
  • 1733