Large degree vertices in longest cycles of graphs. I
From MaRDI portal
Publication:274689
DOI10.7151/DMGT.1861zbMATH Open1338.05136OpenAlexW2330835771MaRDI QIDQ274689FDOQ274689
Authors: Binlong Li, Liming Xiong, Jun Yin
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
Recommendations
Cites Work
- Graph theory
- Some Theorems on Abstract Graphs
- 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
- Longest cycles in \(k\)-connected graphs with given independence number
- Cycles through specified vertices
Cited In (10)
- The longest cycle problem is polynomial on interval graphs
- Cycles through vertices of large maximum degree
- Cycles through specified vertices
- A multi-threading algorithm to detect and remove cycles in vertex- and arc-weighted digraph
- Large degree vertices in longest cycles of graphs. II
- Title not available (Why is that?)
- Title not available (Why is that?)
- Forbidden subgraphs for longest cycles to contain vertices with large degrees
- Cycles containing many vertices of large degree
- Title not available (Why is that?)
This page was built for publication: Large degree vertices in longest cycles of graphs. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q274689)