Large degree vertices in longest cycles of graphs. I
From MaRDI portal
Publication:274689
DOI10.7151/dmgt.1861zbMath1338.05136OpenAlexW2330835771MaRDI QIDQ274689
F. Blanchet-Sadri, M. Dambrine
Publication date: 25 April 2016
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1861
Related Items (3)
A multi-threading algorithm to detect and remove cycles in vertex- and arc-weighted digraph ⋮ The longest cycle problem is polynomial on interval graphs ⋮ Large degree vertices in longest cycles of graphs II
Cites Work
- Unnamed Item
- Longest cycles in \(k\)-connected graphs with given independence number
- Cycles through specified vertices
- Long cycles through specified vertices in a graph
- Cycles in graphs with prescribed stability number and connectivity
- Forbidden subgraphs for longest cycles to contain vertices with large degrees
- A note on Hamiltonian circuits
- 2‐neighborhoods and hamiltonian conditions
- 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. I
