A note on odd/even cycles
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3557519 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Algorithmic Aspects of Vertex Elimination on Graphs
- Characterization of even directed graphs
- Characterizations of totally balanced matrices
- Degrees of acyclicity for hypergraphs and relational database schemes
- Doubly Lexical Orderings of Matrices
- Even cycles in directed graphs
- Qualitative Economics and the Scope of the Correspondence Principle
- Sign-nonsingular matrices and even cycles in directed graphs
- Signsolvability revisited
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- The even-path problem for graphs and digraphs
- Topics on perfect graphs
- Totally-Balanced and Greedy Matrices
Cited in
(7)- A note on disjoint cycles
- Finding large holes
- A note on the total detection numbers of cycles
- Note on even harmonious labeling of cycles
- A polynomial algorithm for the parity path problem on perfectly orientable graphs
- The complexity of induced minors and related problems
- Digraphs with all induced directed cycles of the same length are not \(\vec{\chi}\)-bounded
This page was built for publication: A note on odd/even cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1120591)