Large degree vertices in longest cycles of graphs. I
From MaRDI portal
(Redirected from Publication:274689)
Recommendations
Cites work
- 2‐neighborhoods and hamiltonian conditions
- A note on Hamiltonian circuits
- Cycles in graphs with prescribed stability number and connectivity
- Cycles through specified vertices
- Cycles through specified vertices in triangle-free graphs
- Forbidden subgraphs for longest cycles to contain vertices with large degrees
- Graph theory
- Long cycles through specified vertices in a graph
- Longest cycles in \(k\)-connected graphs with given independence number
- Some Theorems on Abstract Graphs
Cited in
(10)- Cycles through specified vertices
- scientific article; zbMATH DE number 1775051 (Why is no real title available?)
- Large degree vertices in longest cycles of graphs. II
- Cycles containing many vertices of large degree
- A multi-threading algorithm to detect and remove cycles in vertex- and arc-weighted digraph
- scientific article; zbMATH DE number 3979098 (Why is no real title available?)
- Forbidden subgraphs for longest cycles to contain vertices with large degrees
- scientific article; zbMATH DE number 3902690 (Why is no real title available?)
- Cycles through vertices of large maximum degree
- The longest cycle problem is polynomial on interval graphs
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)
