An analogue of the Whithey theorem for edge graphs of multigraphs, and edge multigraphs
From MaRDI portal
Publication:4522752
DOI10.1515/DMA.1997.7.3.287zbMATH Open0966.05050OpenAlexW1968785788WikidataQ56388874 ScholiaQ56388874MaRDI QIDQ4522752FDOQ4522752
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
Recommendations
- Hypergraphs and Whitney's theorem on edge-isomorphisms of graphs
- Note on Whitney's theorem for \(k\)-connected graphs
- A Whitney-type result about rectifiability of graphs
- A hypergraph version of the Gallai-Edmonds Theorem
- scientific article; zbMATH DE number 26488
- scientific article; zbMATH DE number 2097434
- An edge colouring of multigraphs
- A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs
- A Gallai’s Theorem type result for the edge stability of graphs
- Whitney's theorem for infinite graphs
Cited In (10)
- On 1-Hamilton-connected claw-free graphs
- Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected
- Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected
- A closure for Hamilton-connectedness in \(\{K_{1,3}, \Gamma_3\}\)-free graphs
- On Forbidden Pairs Implying Hamilton‐Connectedness
- Hamilton‐connected {claw, bull}‐free graphs
- Hamilton‐connected {claw, net}‐free graphs, I
- Every 3-connected \(\{K_{1, 3}, \Gamma_3\}\)-free graph is Hamilton-connected
- Hypergraphs and Whitney's theorem on edge-isomorphisms of graphs
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4522752)
