scientific article; zbMATH DE number 4045787
From MaRDI portal
Publication:3783322
[For the entire collection see Zbl 0608.00004.] This paper deals briefly with the question of whether any condition on a graph G that implies that its line graph L(G) is Hamiltonian also implies that L(G) is pancyclic. Some known conditions that imply that L(G) is Hamiltonian are discussed and examples are given to show that some of these do not imply that L(G) is pancyclic.
Recommendations
Cited in
(10)- Pancyclic graphs and linear forests
- On pancyclic line graphs
- Pancyclic BIBD block-intersection graphs
- On some cycles in linearized Wenger graphs
- Pancyclic PBD block-intersection graphs
- Subpancyclicity of line graphs and degree sums along paths
- A characterization of pancyclic complements of line graphs
- On circuits and pancyclic line graphs
- scientific article; zbMATH DE number 1215015 (Why is no real title available?)
- Linear election in pancake graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3783322)