Regular subgraphs of almost regular graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3807663 (Why is no real title available?)
- scientific article; zbMATH DE number 3233758 (Why is no real title available?)
- A combinatorial problem on finite Abelian groups. I
- A combinatorial problem on finite Abelian groups. II
- A remark on the factor theorems of lovász and tutte
- Diophantine problems in variables restricted to the values 0 and 1
- Every 4-regular graph plus an edge contains a 3-regular subgraph
- Graph theory with applications
- Representations by \(k\)-th powers in \(GF(q)\)
- The Subgraph Problem
- Three‐regular subgraphs of four‐regular graphs
- [a,b]-factors of graphs
Cited in
(47)- Weight choosability of graphs
- Distinct degrees and homogeneous sets
- 3-Regular subgraphs and (3,1)-colorings of 4-regular pseudographs
- scientific article; zbMATH DE number 7561747 (Why is no real title available?)
- Equicovering subgraphs of graphs and hypergraphs
- Every 4-regular graph plus an edge contains a 3-regular subgraph
- Davenport constant for semigroups.
- Zero-sum problems and coverings by proper cosets
- On the existence of zero-sum subsequences of distinct lengths
- Lucky labelings of graphs
- On graph decompositions modulo \(k\)
- Zero-sum problems for abelian \(p\)-groups and covers of the integers by residue classes
- Regular Turán numbers of complete bipartite graphs
- Warning's second theorem with relaxed outputs
- On 2-coloring certain k-uniform hypergraphs
- Zero-sum problems -- a survey
- A generalization of Kruyswijk-Olson theorem on Davenport constant in commutative semigroups
- Betti numbers of edge ideals of Grimaldi graphs and their complements
- Total \([1,2]\)-domination in graphs
- Regular subgraphs of dense graphs
- The mod k $k$ chromatic index of graphs is O(k) $O(k)$
- Blow-up lemma
- Resolution of the Erdős–Sauer problem on regular subgraphs
- On the complexity of the parity argument and other inefficient proofs of existence
- On zero-sum subsequences of restricted size. II.
- Problems and results in extremal combinatorics. I.
- Graphs with degree sequence \(\{ ( m - 1 )^m , ( n - 1 )^n \}\) and \(\{ m^n , n^m \}\)
- Two zero-sum problems and multiple properties
- Graph factors modulo k
- Nearly-linear monotone paths in edge-ordered graphs
- Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph
- Additive bases of vector spaces over prime fields
- Set systems with no union of cardinality 0 modulo \(m\)
- Colorings and orientations of graphs
- The vertex irregular reflexive labeling of some almost regular graph
- Maximum hypergraphs without regular subgraphs
- On the vertex irregular reflexive labeling of several regular and regular-like graphs
- Normal sequences over finite abelian groups
- Combinatorial nullstellensatz modulo prime powers and the parity argument
- On even-degree subgraphs of linear hypergraphs
- Cohen-Macaulayness of a class of graphs versus the class of their complements
- Graph factors and factorization: 1985--2003: a survey
- An asymptotically tight bound for the Davenport constant
- On Davenport's constant
- Zero-sum problems in finite Abelian groups: a survey
- General graph pebbling
- A note on internal partitions: the 5-regular case and beyond
This page was built for publication: Regular subgraphs of almost regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q595688)
