Path-comprehensive and vertex-pancyclic properties of super line graph \(\mathcal L_2(G)\)
From MaRDI portal
Publication:998369
DOI10.1016/j.disc.2007.11.069zbMath1157.05033OpenAlexW2001032978MaRDI QIDQ998369
Publication date: 28 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.069
Related Items (2)
Line Completion Number of Grid Graph $P_n \times P_m$ ⋮ A number theoretic problem on super line graphs
Cites Work
- On hamiltonian line graphs and connectivity
- Cycles in graphs. (Workshop Cycles in Graphs held at Simon Fraser University, Burnaby, British Columbia, Canada, July 5 - August 20, 1982)
- The super line graph \({\mathfrak L}_2\)
- On a closure concept in claw-free graphs
- Old and new generalizations of line graphs
- Pancyclic graphs. I
- Pancyclism and small cycles in graphs
- Hamiltonian results inK1,3-free graphs
- Reflections on graph theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Path-comprehensive and vertex-pancyclic properties of super line graph \(\mathcal L_2(G)\)