On critical graphs for the chromatic edge-stability number
From MaRDI portal
Publication:2689481
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
- scientific article; zbMATH DE number 3706475 (Why is no real title available?)
- Computing the bipartite edge frustration of fullerene graphs
- Critical graphs for the chromatic edge-stability number
- Graph theory
- Independent domination and graph colorings
- Nordhaus-Gaddum and other bounds for the chromatic edge-stability number
- On the chromatic edge stability number of graphs
Cited in
(10)- scientific article; zbMATH DE number 3969748 (Why is no real title available?)
- Critical graphs for the chromatic edge-stability number
- On critical graphs for the chromatic edge-stability number
- Edge‐chromatic critical graphs and the existence of 1‐factors
- Kolmogorov's problem about the existence of absolute monotone and multiply monotone functions with given norms of derivatives
- scientific article; zbMATH DE number 4168720 (Why is no real title available?)
- Kolmogorov's problem on the class of multiply monotone functions
- scientific article; zbMATH DE number 6769478 (Why is no real title available?)
- A Gallai’s Theorem type result for the edge stability of graphs
- Nordhaus-Gaddum and other bounds for the chromatic edge-stability number
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)