Cyclic base ordering of generalized Petersen graphs
From MaRDI portal
Publication:6551205
DOI10.1142/S1793830923500192zbMATH Open1539.05017MaRDI QIDQ6551205
Publication date: 6 June 2024
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Could not fetch data.
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Density (toughness, etc.) (05C42)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cyclic orderings and cyclic arboricity of matroids
- Augmenting and preserving partition connectivity of a hypergraph
- Characterizations of strength extremal graphs
- Balanced and 1-balanced graph constructions
- Bases-cobases graphs and polytopes of matroids
- Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid
- Transforming a graph into a 1-balanced graph
- Ordering of the elements of a matroid such that its consecutive w elements are independent
- Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
- Convex hulls of dense balanced graphs
- Fractional arboricity, strength, and principal partitions in graphs and matroids
- Connectivity and edge-disjoint spanning trees
- Basis-exchange properties of sparse paving matroids
- Strongly balanced graphs and random graphs
- A theorem on tait colorings with an application to the generalized Petersen graphs
- Self-dual configurations and regular graphs
- Cyclically orderable generalized Petersen graphs
- Cyclic base ordering of certain degenerate graphs
This page was built for publication: Cyclic base ordering of generalized Petersen graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6551205)
