On critical graphs for the chromatic edge-stability number
From MaRDI portal
Publication:2689481
DOI10.1016/J.DISC.2022.113307OpenAlexW4315471550MaRDI QIDQ2689481FDOQ2689481
Authors: Hui Lei, Xiaopan Lian, Xianhao Meng, Yongtang Shi, Yiqiao Wang
Publication date: 10 March 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.13387
Recommendations
- Kolmogorov's problem on the class of multiply monotone functions
- Kolmogorov's problem about the existence of absolute monotone and multiply monotone functions with given norms of derivatives
- On the Kolmogorov problem for the upper bounds of four consecutive derivatives of a multiply monotone function
- Kolmogorov problem on a class of multiply monotone functions
- Kolmogorov problem on a class of multiple monotone functions
Cites Work
- Graph theory
- Computing the bipartite edge frustration of fullerene graphs
- Independent domination and graph colorings
- Title not available (Why is that?)
- On the chromatic edge stability number of graphs
- Nordhaus-Gaddum and other bounds for the chromatic edge-stability number
- Critical graphs for the chromatic edge-stability number
Cited In (7)
- Nordhaus-Gaddum and other bounds for the chromatic edge-stability number
- Title not available (Why is that?)
- On critical graphs for the chromatic edge-stability number
- Title not available (Why is that?)
- A Gallai’s Theorem type result for the edge stability of graphs
- Title not available (Why is that?)
- Edge‐chromatic critical graphs and the existence of 1‐factors
This page was built for publication: On critical graphs for the chromatic edge-stability number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2689481)