scientific article; zbMATH DE number 7746259

DOI10.17223/20710410/60/7MaRDI QIDQ6081723

A. A. Medvedev

Publication date: 5 October 2023

Full work available at URL: http://mathnet.ru/eng/pdm804

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

optimizationdigraphssearch problemspolynomial solvabilitysimple circuitsP classparametrical complexity

Mathematics Subject Classification ID

Computer science (68-XX) Combinatorics (05-XX)

Cites Work

• The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two
• A Semiexact Degree Condition for Hamilton Cycles in Digraphs
• The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
• Note on Hamilton Circuits
• A Dirac-Type Result on Hamilton Cycles in Oriented Graphs
• Finding Long Paths, Cycles and Circuits
• An exact minimum degree condition for Hamilton cycles in oriented graphs
• On longest paths and circuits in graphs.
• Hamilton Paths in Grid Graphs
• Reducibility among Combinatorial Problems
• Automata, Languages and Programming
• Sufficient Conditions for Circuits in Graphs^†
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: