No label defined (Q4691817)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 6963963

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 6963963

Statements

scholarly article

0 references

zbMATH Open document ID

0 references

publication date

24 October 2018

0 references

full work available at URL

http://mathnet.ru/eng/timb172

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

Reducibility among Combinatorial Problems

0 references

The Planar Hamiltonian Circuit Problem is NP-Complete

0 references

0 references

0 references

0 references

Complexity of the hamiltonian cycle in regular graph problem

0 references

Hamilton Paths in Grid Graphs

0 references

Hamiltonian properties of triangular grid graphs

0 references

Not being (super)thin or solid is hard: A study of grid Hamiltonicity

0 references

Hamiltonian properties of locally connected graphs with bounded vertex degree

0 references

HAMILTONian circuits in chordal bipartite graphs

0 references

The edge Hamiltonian path problem is NP-complete

0 references

Complement reducible graphs

0 references

Finding Hamiltonian circuits in interval graphs

0 references

An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs

0 references

Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs

0 references

The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs

0 references

Every connected, locally connected nontrivial graph with no induced claw is hamiltonian

0 references

Extending cycles in graphs

0 references

Cycles of given length in some \(K_{1,3}\)-free graphs

0 references

A note on locally connected and Hamiltonian-connected graphs

0 references

0 references

0 references

Finding Hamiltonian circuits in proper interval graphs

0 references

Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)-Free Graphs

0 references

Finding Hamiltonian cycles in \(\{\)quasi-claw, \(K_{1,5},K_{1,5} + e\}\)-free graphs with bounded Dilworth numbers

0 references

Finding Hamiltonian circuits in quasi-adjoint graphs

0 references

Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs

0 references

Claw-free graphs---a survey

0 references

Hamiltonian circuits in <i>N</i><sub>2</sub>‐locally connected <i>K</i><sub>1,3</sub>‐free graphs

0 references

Vertex pancyclicity in quasi claw-free graphs

0 references

Quadrangularly connected claw-free graphs

0 references

0 references

Fully cycle extendability of \(K_{1,4}\)-restricted graphs

0 references

Locally connected graphs

0 references

Almost claw‐free graphs

0 references

Pancyclicity and NP-completeness in planar graphs

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4691817

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4691817&oldid=36439685"