On the ultimate categorical independence ratio
DOI10.1016/J.JCTB.2014.02.010zbMATH Open1297.05183OpenAlexW2040810897MaRDI QIDQ740645FDOQ740645
Authors: Ágnes Tóth 
Publication date: 4 September 2014
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2014.02.010
Recommendations
- The Ultimate Categorical Independence Ratio of a Graph
- A note on the ultimate categorical matching in a graph
- The Ultimate Categorical Independence Ratio of Complete Multipartite Graphs
- On the ultimate independence ratio of a graph
- Results on independent sets in categorical products of graphs, the ultimate categorical independence ratio and the ultimate categorical independent domination ratio
direct productindependence numbercategorical productasymptotic value of graph parametersindependence ratio
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
Cited In (8)
- A note on the ultimate categorical matching in a graph
- On maximum independent set of categorical product and ultimate categorical ratios of graphs
- An Upper Bound for cat E
- Results on independent sets in categorical products of graphs, the ultimate categorical independence ratio and the ultimate categorical independent domination ratio
- On the ultimate independence ratio of a graph
- On independent domination in direct products
- The Ultimate Categorical Independence Ratio of Complete Multipartite Graphs
- On 3-colorings of direct products of graphs
This page was built for publication: On the ultimate categorical independence ratio
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q740645)
