Graph Theory and Probability
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Clique numbers of graphs and irreducible exact \(m\)-covers of the integers
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
- Edge-decompositions of highly connected graphs into paths
- On k-chromatically connected graphs
- Partitioning graphs into complete and empty graphs
- An uncountably chromatic triple system
- Note on a Ramsey-Turán type problem
- Coloring graphs with locally few colors
- Independent sets in k-chromatic graphs
- Large minimal sets which force arithmetic progressions
- Probabilistic methods
- Fuzzy intersection graphs
- Representing orders on the plane by translating convex figures
- Applications of edge coloring of multigraphs to vertex coloring of graphs
- The distribution of the maximum degree of a random graph
- On semigroups of graph endomorphisms
- Degree sequences of random graphs
- On the coverings of graphs
- Critically partitionable graphs. II
- Graphs without large triangle free subgraphs
- Reorientations of covering graphs
- Computing independent sets in graphs with large girth
- On cubical graphs
- Chromatic number and girth
- Restricted Ramsey configurations
- On an upper bound of the graph's chromatic number, depending on the graph's degree and density
- Colouring lattices
- Asymptotic lower bounds for Ramsey functions
- Survey sampling in graphs
- On classes of relations and graphs determined by subobjects and factorobjects
- Chromatic number, girth and maximal degree
- A short proof of the existence of highly chromatic hypergraphs without short cycles
- Elements of a theory of computer simulation. I
- Around quasidiagonal operators
- Complexity of diagrams
- Probabilistic methods in coloring and decomposition problems
- Compactness and finite equivalence of infinite digraphs
- Some theorems concerning the star chromatic number of a graph
- On some conjectures of Graffiti
- The number of dependent arcs in an acyclic orientation
- Inequalities for the chromatic numbers of graphs
- A few remarks on Ramsey--Turán-type problems
- Extremal problems for ordered (hyper)graphs: Applications of Davenport-Schinzel sequences
- 3-colorability and forbidden subgraphs. I: Characterizing pairs
- On sparse graphs with given colorings and homomorphisms.
- 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs.
- Triangle-free graphs and forbidden subgraphs
- Phase transitions in discrete structures
- Induced subgraphs of graphs with large chromatic number. XI. Orientations
- On the chromatic number of \(2 K_2\)-free graphs
- Bispindles in strongly connected digraphs with large chromatic number
- Ramsey-nice families of graphs
- On the chromatic numbers of rational spaces
- Axiomatisability and hardness for universal Horn classes of hypergraphs
- A note on chromatic number and induced odd cycles
- On a Frankl-Rödl theorem and its geometric corollaries
- Chromatic number and subtrees of graphs
- Generalised Ramsey numbers for two sets of cycles
- New construction of graphs with high chromatic number and small clique number
- Characterization of forbidden subgraphs for bounded star chromatic number
- A note on chromatic number of (cap, even hole)-free graphs
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- The effect of local majority on global majorityin connected graphs
- Conditional chromatic numbers with forbidden cycles
- Degree multiplicities and independent sets in \(K_ 4\)-free graphs
- Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
- Compactness results in extremal graph theory
- From graphs to ortholattices and equivariant maps
- Nearly bipartite graphs with large chromatic number
- Density via duality.
- Tough Ramsey graphs without short cycles
- Degree sequence and independence in K(4)-free graphs
- Finitely axiomatizable quasivarieties of graphs
- Online graph exploration: New results on old and new algorithms
- On graphs with a large chromatic number that contain no small odd cycles
- A better upper bound on the chromatic number of (cap, even-hole)-free graphs
- On forbidden induced subgraphs for \(K_{1, 3}\)-free perfect graphs
- Extension of Gyárfás-Sumner conjecture to digraphs
- Chromatic numbers of distance graphs without short odd cycles in rational spaces
- Notes on tree- and path-chromatic number
- Note on Hedetniemi's conjecture and the Poljak-Rödl function
- On three blocks paths \(P (k, l, r)\)
- Subdivisions of oriented cycles in Hamiltonian digraphs with small chromatic number
- From \(\chi\)- to \(\chi_p\)-bounded classes
- Immersion and clustered coloring
- Distance labeling schemes for \(K_4\)-free bridged graphs
- A note on a conjecture of Wu, Xu and Xu
- High girth hypergraphs with unavoidable monochromatic or rainbow edges
- Total domination in regular graphs
- Tree-width dichotomy
- Best and random approximation of a convex body by a polytope
- Computing first and second fuzzy Zagreb indices of linear and multiacyclic hydrocarbons
- The fractional chromatic number of generalized cones over graphs
- Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs
- Trees contained in every orientation of a graph
- Generalized signed graphs of large girth and large chromatic number
- On the chromatic number of some \(P_5\)-free graphs
- Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\)
- Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions
- Chromatic numbers of distance graphs with several forbidden distances and without cliques of a given size
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)
