On traceable line graphs

DOI10.1007/S00373-013-1371-3zbMATH Open1306.05207OpenAlexW2086759748MaRDI QIDQ489359FDOQ489359

Zhaohong Niu, Liming Xiong

Publication date: 20 January 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1371-3

Recommendations

• Traceability of line graphs
• Traceability on 2-connected line graphs
• scientific article; zbMATH DE number 2065936
• scientific article; zbMATH DE number 6006
• On minimum degree, leaf number, traceability and Hamiltonicity in graphs

zbMATH Keywords

line graph\(F\)-traildominating trailHamiltonian cycle (path)

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• On dominating and spanning circuits in graphs
• Title not available (Why is that?)
• A reduction method to find spanning Eulerian subgraphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Supereulerian graphs: A survey
• On hamiltonian line graphs
• Traceability of line graphs
• Hamiltonian line graphs
• Eulerian subgraphs containing given vertices and hamiltonian line graphs
• On circuits and pancyclic line graphs

Cited In (4)

• On the Representability of Line Graphs
• Graphs with prescribed Levi form trace
• Traceability of line graphs
• Title not available (Why is that?)

This page was built for publication: On traceable line graphs

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