The Subgraph Problem
From MaRDI portal
Cited in
(24)- Factors of regular graphs
- Parity results on connected f-factors
- Biregular subgraphs of biregular graphs
- On factors in random graphs
- Graph factors
- Simplified existence theorems for \((g,f)\)-factors
- Efficient algorithms for path partitions
- Minimum degree, independence number and regular factors
- Sufficient conditions for graphs to have (g,f)-factors
- Regular colorings in regular graphs
- (r,r+1)-factorizations of (d,d+1)-graphs
- Covering and packing in graphs IV: Linear arboricity
- On locally-balanced 2-partitions of bipartite graphs
- 3-Regular subgraphs and (3,1)-colorings of 4-regular pseudographs
- On the factor-thickness of regular graphs
- [a,b]-factors of graphs
- Regular subgraphs of almost regular graphs
- Factors with red-blue coloring of claw-free graphs and cubic graphs
- Degree factors with red-blue coloring of regular graphs
- Comparing the p-independence number of regular graphs to the q-independence number of their line graphs
- \(\{k,r-k\}\)-factors of \(r\)-regular graphs
- A simple existence criterion for \((g<f)\)-factors
- On linear k-arboricity
- Three-regular parts of four-regular graphs
This page was built for publication: The Subgraph Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4156805)
