Graph Theory and Probability
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- An intersection theorem for four sets
- Canonical varieties with no canonical axiomatisation
- On the dimension of a graph
- Restricted frame graphs and a conjecture of Scott
- Partition relations for cardinal numbers
- Toughness in graphs -- a survey
- The number of dependent arcs in an acyclic orientation
- Coloring of a superclass of \(2K_2\)-free graphs
- Probabilistic methods
- Induced subgraphs of graphs with large chromatic number. I. Odd holes
- Vertex-critical graphs in co-gem-free graphs
- From \(\chi\)- to \(\chi_p\)-bounded classes
- Immersion and clustered coloring
- scientific article; zbMATH DE number 3285073 (Why is no real title available?)
- Counterexamples to Hedetniemi's conjecture
- On the chromatic number of some \(P_5\)-free graphs
- Introducing Quasirandomness to Computer Science
- Note on robust critical graphs with large odd girth
- Inequalities for the chromatic numbers of graphs
- Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four
- The micro-world of cographs
- Tree-width dichotomy
- Representing orders on the plane by translating convex figures
- A hierarchy of randomness for graphs
- scientific article; zbMATH DE number 3693338 (Why is no real title available?)
- Graph partitions with prescribed patterns
- On \((r,g, \chi))\)-graphs and cages of regularity \(r\), girth \(g\) and chromatic number \(\chi \)
- Unavoidable tournaments
- Probabilistic combinatorics and the recent work of Peter Keevash
- Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs
- Hedetniemi's conjecture is asymptotically false
- Classes of graphs with small rank decompositions are \(\chi \)-bounded
- Separating tree-chromatic number from path-chromatic number
- Colouring graphs when the number of colours is almost the maximum degree
- Asymptotic bounds on total domination in regular graphs
- Folding list of graphs obtained from a given graph
- \( \chi \)-binding function for \((C_4, t\text{-broom}^+)\)-free graphs
- Online Graph Exploration: New Results on Old and New Algorithms
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- On nowhere dense graphs
- Fuzzy intersection graphs
- Almost all graphs with high girth and suitable density have high chromatic number
- Density via duality.
- On sparse parity check matrices (extended abstract)
- Box complexes: at the crossroad of graph theory and topology
- Burling graphs revisited. III: Applications to \(\chi \)-boundedness
- Coloring graphs without short cycles and long induced paths
- Coloring graphs with fixed genus and girth
- Graphs with large girth and chromatic number are hard for Nullstellensatz
- Astral graphs (threshold graphs), scale-free graphs and related algorithmic questions
- On forbidden induced subgraphs for \(K_{1, 3}\)-free perfect graphs
- High girth hypergraphs with unavoidable monochromatic or rainbow edges
- Online coloring graphs with high girth and high odd girth
- Some remarks on the theory of graphs
- The effect of local majority on global majorityin connected graphs
- Chromatic number, girth and maximal degree
- A short proof of the existence of highly chromatic hypergraphs without short cycles
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
- Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
- Homotopy types of the Hom complexes of graphs
- VC-dimension and Erdős-Pósa property
- Acyclic colorings of planar graphs
- Oriented trees in \(O(k \sqrt{k})\)-chromatic digraphs, a subquadratic bound for Burr's conjecture
- Phase transitions in discrete structures
- Splittings in varieties of logic
- 3-colorability and forbidden subgraphs. I: Characterizing pairs
- On the chromatic number of \(2 K_2\)-free graphs
- Proper interval vertex colorings of graphs
- On an upper bound of the graph's chromatic number, depending on the graph's degree and density
- Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
- Algorithmic bounds for the chromatic number†
- Reorientations of covering graphs
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- Extending the Gyárfás-Sumner conjecture
- Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of \(P_4\) (extended abstract)
- Chromatic number of intersection graphs of segments with two slopes (extended abstract)
- Extension of Gyárfás-Sumner conjecture to digraphs
- On the coverings of graphs
- Applications of edge coloring of multigraphs to vertex coloring of graphs
- Erdős Graphs Resolve Fine's Canonicity Problem
- On cubical graphs
- Best and random approximation of a convex body by a polytope
- Characterization of forbidden subgraphs for bounded star chromatic number
- Locally planar graphs are 5-choosable
- Graph Theory and Probability. II
- Local convergence of random graph colorings
- Atom-canonicity in varieties of cylindric algebras with applications to omitting types in multi-modal logic
- Induced subgraphs of graphs with large chromatic number. XI. Orientations
- Odd chromatic number of graph classes
- 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs.
- Polynomial Gyárfás-Sumner conjecture for graphs of bounded boxicity
- Random graphs and covering graphs of posets
- The Erdős-Hajnal conjecture. A survey
- Towards optimal \(\chi \)-binding functions of \((2K_1 \cup K_2)\)-free graphs and \((P_3 \cup K_1)\)-free graphs
- Obstructions for three-coloring and list three-coloring \(H\)-free graphs
- Contact graphs of boxes with unidirectional contacts
- Computing independent sets in graphs with large girth
- Uniquely \(D\)-colourable digraphs with large girth. II: Simplification via generalization
- Computing first and second fuzzy Zagreb indices of linear and multiacyclic hydrocarbons
This page was built for publication: Graph Theory and Probability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3253064)
