A simple algorithm for finding a cycle of length greater than three and without diagonals
type: Item
instance of: scholarly article
title: A simple algorithm for finding a cycle of length greater than three and without diagonals
zbMATH Open document ID: 0449.68026
DOI: 10.1007/BF02243441
published in: Computing
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 3703985
zbMATH Keywords: algorithm
zbMATH Keywords: cycle
author: Mirosław Truszczyński
MaRDI profile type: Publication
cites work: Q4091421
cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
cites work: Finding a Minimum Circuit in a Graph
cites work: Information storage and retrieval - mathematical foundations. II: Combinatorial problems
cites work: Triangulated graphs and the elimination process
full work available at URL: https://doi.org/10.1007/bf02243441
OpenAlex ID: W2922630147
description: scientific article; zbMATH DE number 3703985