A Theorem on k-Saturated Graphs
From MaRDI portal
Publication:5338787
DOI10.4153/CJM-1965-072-1zbMath0129.39901MaRDI QIDQ5338787
Publication date: 1965
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Related Items
On the size of \((K_t, K_{1, k})\)-co-critical graphs ⋮ Packings by Complete Bipartite Graphs ⋮ WELL-COVERED GRAPHS: A SURVEY ⋮ Stability critical graphs and ranks facets of the stable set polytope ⋮ On the size of \((K_t, P_k)\)-co-critical graphs ⋮ On factors with given components ⋮ A Note on Hitting Maximum and Maximal Cliques With a Stable Set ⋮ Two more characterizations of König-Egerváry graphs ⋮ On replete graphs ⋮ Graphs with $\chi=\Delta$ Have Big Cliques ⋮ Order plus size of τ‐critical graphs ⋮ The Success Probability in Levine’s Hat Problem, and Independent Sets in Graphs ⋮ A set and collection lemma ⋮ The equivalence of the Szemerédi and Petruska conjecture and the maximum order of 3-uniform \(\tau\)-critical hypergraphs ⋮ On a generalization of linecritical graphs ⋮ Hitting all maximum stable sets in \(P_5\)-free graphs ⋮ Saturated Graphs of Prescribed Minimum Degree ⋮ On the order of uniquely (k,m)-colourable graphs ⋮ Unnamed Item ⋮ On the size of \((K_t,\mathcal{T}_k)\)-co-critical graphs ⋮ Very large cliques are easy to detect ⋮ On bounding the difference of the maximum degree and the clique number ⋮ Preperfect graphs ⋮ Facets of the linear ordering polytope: a unification for the fence family through weighted graphs ⋮ On the minimum energy of regular graphs ⋮ A first family of edge-critical wheels ⋮ Hitting all maximum cliques with a stable set using lopsided independent transversals ⋮ On hitting all maximum cliques with an independent set ⋮ Partite Saturation of Complete Graphs ⋮ Matchings and covers in hypergraphs ⋮ On some subclasses of well-covered graphs ⋮ Revisiting a theorem by Folkman on graph colouring ⋮ Spectral strengthening of a theorem on transversal critical graphs ⋮ Sur un problème de Erdős et Hajnal ⋮ Petruska's question on planar convex sets ⋮ Ear-decompositions of matching-covered graphs ⋮ A note on coloring vertex-transitive graphs ⋮ On a weighted generalization of α-critical graphs ⋮ Stable sets and polynomials ⋮ Factors of regular graphs
