Computing and Combinatorics

DOI10.1007/11533719zbMath1128.05303OpenAlexW4376561447MaRDI QIDQ5717010

Guantao Chen, Wenan Zang, Xingxing Yu, Zhi-Cheng Gao

Publication date: 11 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11533719

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

The longest cycle problem is polynomial on interval graphs ⋮ Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs

This page was built for publication: Computing and Combinatorics