Polynomial enumeration of chordless cycles on cyclically orientable graphs

DOI10.21711/231766362015/RMC4419MaRDI QIDQ6489459FDOQ6489459

Authors Diane Castonguay, Elisângela Silva Dias 

Publication date 22 April 2024

Published in Matemática Contemporânea (Search for Journal in Brave)

zbMATH Keywords

chordless cyclescyclically orientable graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Recommendations

• Amortized $\tilde{O}(|V|)$ -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs
• Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion
• Enumerating cyclic orientations of a graph
• Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• scientific article; zbMATH DE number 1247175

This page was built for publication: Polynomial enumeration of chordless cycles on cyclically orientable graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6489459)