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

DOI10.1515/dma.1997.7.3.287zbMath0966.05050OpenAlexW1968785788WikidataQ56388874 ScholiaQ56388874MaRDI QIDQ4522752

Igor Edm. Zverovich

Publication date: 7 March 2001

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.1997.7.3.287

zbMATH Keywords

multigraphsWhitney theoremedge graphsedge multigraphs

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (7)

Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected ⋮ On 1-Hamilton-connected claw-free graphs ⋮ Hamilton‐connected {claw, bull}‐free graphs ⋮ Hamilton‐connected {claw, net}‐free graphs, I ⋮ On Forbidden Pairs Implying Hamilton‐Connectedness ⋮ Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected ⋮ Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs

This page was built for publication: An analogue of the Whithey theorem for edge graphs of multigraphs, and edge multigraphs