Cyclic base ordering of certain degenerate graphs
From MaRDI portal
Recommendations
Cites work
- k-Degenerate Graphs
- Augmenting and preserving partition connectivity of a hypergraph
- Balanced and 1-balanced graph constructions
- Bases-cobases graphs and polytopes of matroids
- Basis-exchange properties of sparse paving matroids
- Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid
- Characterizations of strength extremal graphs
- Connectivity and edge-disjoint spanning trees
- Convex hulls of dense balanced graphs
- Cyclic base orderings in some classes of graphs
- Cyclic orderings and cyclic arboricity of matroids
- Fractional arboricity, strength, and principal partitions in graphs and matroids
- Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
- scientific article; zbMATH DE number 4130426 (Why is no real title available?)
- scientific article; zbMATH DE number 3750966 (Why is no real title available?)
- scientific article; zbMATH DE number 3542457 (Why is no real title available?)
- scientific article; zbMATH DE number 1452400 (Why is no real title available?)
- Non-separable and planar graphs.
- Ordering of the elements of a matroid such that its consecutive w elements are independent
- Partitioning a graph into two square-cycles
- Sequences realizable by maximal k‐degenerate graphs
- Strongly balanced graphs and random graphs
- Structural results on maximal k-degenerate graphs
- The Square of a Hamiltonian Cycle
- Transforming a graph into a 1-balanced graph
Cited in
(2)
This page was built for publication: Cyclic base ordering of certain degenerate graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6657273)