Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

On traceable line graphs

From MaRDI portal
Publication:489359
Jump to:navigation, search

DOI10.1007/S00373-013-1371-3zbMath1306.05207OpenAlexW2086759748MaRDI QIDQ489359

Zhaohong Niu, Limning 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


zbMATH Keywords

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


Mathematics Subject Classification ID

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





Cites Work

  • Unnamed Item
  • Traceability of line graphs
  • On dominating and spanning circuits in graphs
  • Eulerian subgraphs containing given vertices and hamiltonian line graphs
  • On hamiltonian line graphs
  • On circuits and pancyclic line graphs
  • A reduction method to find spanning Eulerian subgraphs
  • Hamiltonian line graphs
  • Supereulerian graphs: A survey
  • On Eulerian and Hamiltonian Graphs and Line Graphs




This page was built for publication: On traceable line graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:489359&oldid=12370794"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 05:06.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki