The spanning connectivity of line graphs

DOI10.1016/J.AML.2011.04.013zbMATH Open1219.05083OpenAlexW2088654300MaRDI QIDQ548422FDOQ548422

Po-Yi Huang, Lih-Hsing Hsu

Publication date: 28 June 2011

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2011.04.013

Recommendations

• On spanning connected graphs
• On the spanning connectivity of graphs
• On the spanning fan-connectivity of graphs
• A condition on Hamilton-connected line graphs
• Hamiltonian paths in spanning subgraphs of line graphs

zbMATH Keywords

containerHamiltonian cycleconnectivityedge connectivityHamiltonian connected

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Connectivity (05C40)

Cites Work

• On a closure concept in claw-free graphs
• A reduction method to find spanning Eulerian subgraphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• The super connectivity of the pancake graphs and the super laceability of the star graphs
• Some Theorems on Abstract Graphs
• Hamiltonian results inK1,3-free graphs
• Supereulerian graphs: A survey
• Edge-connectivity and edge-disjoint spanning trees
• The reduction of graph families closed under contraction
• Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected
• Reflections on graph theory
• On hamiltonian line graphs and connectivity
• On \(s\)-Hamiltonian-connected line graphs
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• All 4-connected line graphs of claw free graphs are Hamiltonian connected
• On the spanning fan-connectivity of graphs
• On spanning connected graphs
• Title not available (Why is that?)

Cited In (11)

• Packing spanning trees in highly essentially connected graphs
• Connectivity of iterated line graphs
• Polynomially determining spanning connectivity of locally connected line graphs
• On spanning disjoint paths in line graphs
• Generation of 3-connected, planar line graphs
• Spanning connectivity of the power of a graph and Hamilton-connected index of a graph
• Title not available (Why is that?)
• Fault tolerance of hypercube like networks: spanning laceability under edge faults
• Degree sequence conditions for a graph to be disjoint path coverable
• On the spanning connectivity of tournaments
• Complete family reduction and spanning connectivity in line graphs

This page was built for publication: The spanning connectivity of line graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548422)