A Note on Hitting Maximum and Maximal Cliques With a Stable Set (Q5325947): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963439943 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1109.3092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent systems of representatives in weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an upper bound of the graph's chromatic number, depending on the graph's degree and density / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hajos' graph-coloring conjecture: Variations and counterexamples / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on <i>k</i>-Saturated Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A condition for matchability in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hitting all maximum cliques with a stable set using lopsided independent transversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3909076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hitting all maximum cliques with an independent set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242948 / rank
 
Normal rank

Latest revision as of 16:23, 6 July 2024

scientific article; zbMATH DE number 6193109
Language Label Description Also known as
English
A Note on Hitting Maximum and Maximal Cliques With a Stable Set
scientific article; zbMATH DE number 6193109

    Statements

    Identifiers