Large degree vertices in longest cycles of graphs II

DOI10.5614/ejgta.2019.7.2.7zbMath1467.05139OpenAlexW2980893834MaRDI QIDQ5009954

No author found.

Publication date: 23 August 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2019.7.2.7

zbMATH Keywords

connectivitylongest cycleindependent numberlarge degree vertex

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (1)

On 2-power unicyclic cubic graphs

Cites Work

• Unnamed Item
• Large degree vertices in longest cycles of graphs. I
• Cycles through specified vertices
• A method in graph theory
• Long cycles through specified vertices in a graph
• On cycles through a given vertex in multipartite tournaments
• Forbidden subgraphs for longest cycles to contain vertices with large degrees
• A note on Hamiltonian circuits
• On long cycles through four prescribed vertices of a polyhedral graph
• 2‐neighborhoods and hamiltonian conditions
• Forbidden subgraph pairs for traceability of block-chains
• Intersecting longest paths and longest cycles: A survey
• Cycles through specified vertices in triangle-free graphs
• Some Theorems on Abstract Graphs

This page was built for publication: Large degree vertices in longest cycles of graphs II