On the size of \((K_t, P_k)\)-co-critical graphs
From MaRDI portal
Publication:2163839
DOI10.1007/s00373-022-02531-wzbMath1494.05067OpenAlexW4291720080MaRDI QIDQ2163839
Jingmei Zhang, Gang Chen, Zi-Xia Song, Zheng-Ke Miao
Publication date: 11 August 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-022-02531-w
Cites Work
- Unnamed Item
- Unnamed Item
- Saturation numbers for families of Ramsey-minimal graphs
- A survey of minimum saturated graphs
- Saturation numbers for Ramsey-minimal graphs
- On the size of \((K_t, K_{1, k})\)-co-critical graphs
- On the size of \((K_t,\mathcal{T}_k)\)-co-critical graphs
- On the size of special class 1 graphs and \((P_3;k)\)-co-critical graphs
- Ramsey-minimal saturation numbers for matchings
- Minimalk-saturated and color critical graphs of prescribed minimum degree
- Edge-colored saturated graphs
- A Theorem on k-Saturated Graphs
- Saturated Graphs of Prescribed Minimum Degree