A polynomial algorithm for the parity path problem on perfectly orientable graphs
type: Item
instance of: scholarly article
title: A polynomial algorithm for the parity path problem on perfectly orientable graphs
zbMATH Open document ID: 0854.68069
DOI: 10.1016/0166-218X(95)00086-7
author: S. R. Arikati
author: Uri N. Peled
published in: Discrete Applied Mathematics
publication date: 1996-07-07T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 897370
zbMATH Keywords: parity path problem
MaRDI profile type: Publication
cites work: A linear algorithm for the group path problem on chordal graphs
cites work: Efficient reduction for path problems on circular-arc graphs
cites work: Topics on perfect graphs
cites work: On the complexity of testing for odd holes and induced odd paths
cites work: Which claw-free graphs are perfectly orderable?
cites work: Chordless Paths, Odd Holes, and Kernels in Graphs Without m-Obstructions
cites work: Q3328583
cites work: The even-path problem for graphs and digraphs
cites work: A note on odd/even cycles
cites work: On the complexity of recognizing perfectly orderable graphs
cites work: Algorithmic Aspects of Vertex Elimination on Graphs
Recommended article: Q3216686
Recommended article: A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs
Recommended article: An efficient algorithm for computing permanental polynomials of graphs
Recommended article: The parity path problem on some subclasses of perfect graphs
Recommended article: Q3140457
Recommended article: Q5743428
Recommended article: Q4028893
Recommended article: Q4325297
Recommended article: A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs
Recommended article: A polynomial-time algorithm for the paired-domination problem on permutation graphs
description: scientific article; zbMATH DE number 897370