On saturation problems for matchings with regularity constraints
From MaRDI portal
Cites work
- Dynamic cage survey
- Graph theory
- scientific article; zbMATH DE number 3865320 (Why is no real title available?)
- scientific article; zbMATH DE number 7633016 (Why is no real title available?)
- Matching theory
- Maximal triangle‐free graphs with restrictions on the degrees
- Minimalk-saturated and color critical graphs of prescribed minimum degree
- Onk-saturated graphs with restrictions on the degrees
- Regular saturated graphs and sum-free sets
- Regular Tur\'an numbers
- Regular Turán numbers and some Gan–Loh–Sudakov‐type problems
- Regular Turán numbers of complete bipartite graphs
- Saturated graphs of prescribed minimum degree
- Saturation problems with regularity constraints
- Singular Turán numbers and worm-colorings
- Some exact results for regular Turán problems for all large orders
This page was built for publication: On saturation problems for matchings with regularity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7326056)