Cyclic ordering of edges without long acyclic subsequences

DOI10.61091/CN235-04MaRDI QIDQ7013957zbMATH OpenFDO

Authors Yanting Liang, Sarah Locke, Andrea Trice

Publication date 11 March 2025

Published in Congressus Numerantium (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

cyclic orderingsuniformly dense graphscyclic base ordering

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Density (toughness, etc.) (05C42)

Cites work

• scientific article; zbMATH DE number 4130426 (Why is no real title available?)
• scientific article; zbMATH DE number 36698 (Why is no real title available?)
• scientific article; zbMATH DE number 4121463 (Why is no real title available?)
• scientific article; zbMATH DE number 969101 (Why is no real title available?)
• Bases-cobases graphs and polytopes of matroids
• Cyclic base orderings in some classes of graphs
• Cyclic orderings and cyclic arboricity of matroids
• Every matroid is a submatroid of a uniformly dense matroid
• Fractional arboricity, strength, and principal partitions in graphs and matroids
• Graph theory
• On the higher-order edge toughness of a graph
• Ordering of the elements of a matroid such that its consecutive w elements are independent
• Transforming a graph into a 1-balanced graph

This page was built for publication: Cyclic ordering of edges without long acyclic subsequences

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