A note on odd/even cycles

DOI10.1016/0166-218X(88)90125-4zbMath0673.05058OpenAlexW1968569343MaRDI QIDQ1120591

Anna Lubiw

Publication date: 1988

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(88)90125-4

zbMATH Keywords

digraphchordless cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

The complexity of induced minors and related problems ⋮ A polynomial algorithm for the parity path problem on perfectly orientable graphs ⋮ Finding large holes ⋮ Digraphs with all induced directed cycles of the same length are not \(\vec{\chi}\)-bounded

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Signsolvability revisited
• Topics on perfect graphs
• Sign-nonsingular matrices and even cycles in directed graphs
• Even cycles in directed graphs
• Characterization of even directed graphs
• Degrees of acyclicity for hypergraphs and relational database schemes
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Characterizations of totally balanced matrices
• The even-path problem for graphs and digraphs
• Totally-Balanced and Greedy Matrices
• Doubly Lexical Orderings of Matrices
• Algorithmic Aspects of Vertex Elimination on Graphs
• Qualitative Economics and the Scope of the Correspondence Principle

This page was built for publication: A note on odd/even cycles