Author:
Nešetřil Jaroslav,Shelah Saharon
Subject
Discrete Mathematics and Combinatorics
Reference21 articles.
1. Universal graphs with forbidden subgraphs and algebraic closure;Cherlin;Adv. Appl. Math.,1999
2. Every finite graph is a full subgraph of a rigid graph;Chvátal;J. Combin. Theory,1971
3. High chromatic rigid graphs II;Babai;Ann. Discrete Math.,1982
4. A family of countable homogeneous graphs;Ward Henson;Pacific J. Math.,1971
5. Universal relational systems;Jónsson;Math. Scand.,1956
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On low rank-width colorings;European Journal of Combinatorics;2020-01
2. On Treewidth and Related Parameters of Random Geometric Graphs;SIAM Journal on Discrete Mathematics;2017-01
3. On Low Rank-Width Colorings;Graph-Theoretic Concepts in Computer Science;2017
4. Structural sparsity;Russian Mathematical Surveys;2016-02-28
5. On Low Tree-Depth Decompositions;Graphs and Combinatorics;2015-04-23