A Theorem on k-Saturated Graphs
From MaRDI portal
Publication:5338787
Cited in
(47)- Ear-decompositions of matching-covered graphs
- Factors of regular graphs
- On a generalization of linecritical graphs
- A first family of edge-critical wheels
- Stable sets and polynomials
- Matchings and covers in hypergraphs
- Stability critical graphs and ranks facets of the stable set polytope
- Spectral strengthening of a theorem on transversal critical graphs
- On the size of \((K_t, K_{1, k})\)-co-critical graphs
- On the size of \((K_t, P_k)\)-co-critical graphs
- On the size of \((K_t,\mathcal{T}_k)\)-co-critical graphs
- On the minimum energy of regular graphs
- Revisiting a theorem by Folkman on graph colouring
- A note on coloring vertex-transitive graphs
- Two more characterizations of König-Egerváry graphs
- Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
- Sur un problème de Erdős et Hajnal
- Graphs with \(\chi=\Delta\) have big cliques
- On hitting all maximum cliques with an independent set
- On a weighted generalization of α-critical graphs
- Packings by Complete Bipartite Graphs
- On replete graphs
- A set and collection lemma
- On some subclasses of well-covered graphs
- WELL-COVERED GRAPHS: A SURVEY
- On bounding the difference of the maximum degree and the clique number
- The minimum number of vertices of graphs containing two monochromatic triangles for any edge \(2\)-coloring
- Hitting all maximum cliques with a stable set using lopsided independent transversals
- Partite saturation of complete graphs
- A note on hitting maximum and maximal cliques with a stable set
- Saturated graphs of prescribed minimum degree
- On factors with given components
- Order plus size of τ‐critical graphs
- The Success Probability in Levine’s Hat Problem, and Independent Sets in Graphs
- The equivalence of the Szemerédi and Petruska conjecture and the maximum order of 3-uniform -critical hypergraphs
- Hitting all maximum stable sets in P₅-free graphs
- \(K_r\)-saturated graphs and the two families theorem
- Preperfect graphs
- The saturation number of wheels
- On tight (k,)-stable graphs
- Bollobás-Erdős-Tuza conjecture for graphs with no induced \(K_{s , t}\)
- On the -edge stability number of graphs
- A proof of the (n, k, t) conjectures
- Sublinear hitting sets for some geometric graphs
- Petruska's question on planar convex sets
- On the order of uniquely (k,m)-colourable graphs
- Very large cliques are easy to detect
This page was built for publication: A Theorem on k-Saturated Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5338787)
