scientific article; zbMATH DE number 3652373
From MaRDI portal
Publication:3852212
Cited in
(only showing first 100 items - show all)- Some three-color Ramsey numbers, R(P₄,P₅,C_k) and R(P₄,P₆,C_k)
- On the homogeneous algebraic graphs of large girth and their applications
- Unit distances and diameters in Euclidean spaces
- Factor-critical graphs with given number of maximum matchings
- Combinatorial designs and the theorem of Weil on multiplicative character sums
- Large disjoint subgraphs with the same order and size
- Constructions of bi-regular cages
- A fast parallel algorithm for finding Hamiltonian cycles in dense graphs
- Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\)
- Extension problems with degree bounds
- Minimum cuts, girth and a spectral threshold
- Hardness of edge-modification problems
- On cyclic edge-connectivity of transitive graphs
- Stability of the path-path Ramsey number
- Ordered colourings of graphs
- On the maximum density of graphs which have no subcontraction to \(K^ r\).
- A note on the probabilistic approach to Turan's problem
- Minimally k-connected graphs of low order and maximal size
- On color critical graphs
- Further nonparametric tests for comparing dissimilarity matrices based on the relative neighborhood graph
- An extremal problem for sets with applications to graph theory
- Every poset has a central element
- Factors of regular graphs
- Separating pairs of points of standard boxes
- Time-space trade-offs for branching programs
- The complexity of colouring problems on dense graphs
- Minimally 3-connected graphs
- The average size of an independent set in graphs with a given chromatic number
- Maximum induced trees in graphs
- Sufficient conditions for maximally connected dense graphs
- Counterexample to a conjecture on Hamilton cycles
- On lattices with Möbius function \(\pm 1,0\)
- Extremal problems concerning transformations of the set of edges of the complete graph
- Two theorems on packings of graphs
- Edge-connectivity augmentation problems
- Inequalities relating degrees of adjacent vertices to the average degree
- What can we hope to accomplish in generalized Ramsey theory ?
- Another extremal problem for Turan graphs
- Local k-colorings of graphs and hypergraphs
- The binding number of a graph and its triangle
- The connectivities of adjacent tree graphs
- A lower bound on connectivities of matroid base graphs
- On common edges in optimal solutions to traveling salesman and other optimization problems
- Intersection properties of boxes. I: An upper-bound theorem
- The number of triangles in a \(K_ 4\)-free graph
- Exact solution of some Turán-type problems
- Simplicial decompositions of graphs: A survey of applications
- Triad count statistics
- Efficient approximate solution of sparse linear systems
- The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true
- Efficient algorithms for a mixed \(k\)-partition problem of graphs without specifying bases
- On graphs with equal edge connectivity and minimum degree
- The distribution of the maximum degree of a random graph
- Girth, valency, and excess
- Ramsey numbers for matchings
- Degree sequences of random graphs
- Hadwiger's conjecture is true for almost every graph
- Sorting in one round
- The size of connected hypergraphs with prescribed covering number
- Critically partitionable graphs. II
- Equitable and proportional coloring of trees
- On finite Ramsey numbers
- The maximal size of graphs with at most \(k\) edge-disjoint paths connecting any two adjacent vertices
- Biased graphs. II: The three matroids
- Constructing the relative neighborhood graph in 3-dimensional Euclidean space
- Lower bounds on the stability number of graphs computed in terms of degrees
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- The chromatic uniqueness of complete bipartite graphs
- Long cycles in subgraphs with prescribed minimum degree
- Saturated r-uniform hypergraphs
- On some factor theorems of graphs
- Perfect matching for regular graphs is AC^ 0-hard for the general matching problem
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
- Generalized local colorings of graphs
- Counting and cutting cycles of lines and rods in space
- Davenport-Schinzel theory of matrices
- Bounds on the number of complete subgraphs
- On sparse spanners of weighted graphs
- On small graphs with highly imperfect powers
- Matching theory -- a sampler: From Dénes König to the present
- Turán theorems with repeated degrees
- Graphs with small diameter after edge deletion
- Examples of products giving large graphs with given degree and diameter
- Reducible chains in several types of 2-connected graphs
- On games of incomplete information
- Asymptotic growth of sparse saturated structures is locally determined
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- A Turán-type theorem on chords of a convex polygon
- On embedding of graphs into Euclidean spaces of small dimension
- Lower bound of cyclic edge connectivity for n-extendability of regular graphs
- Uniquely colorable graphs
- Chromatic number, girth and maximal degree
- Dense neighbourhoods and Turan's theorem
- Set colourings of graphs
- Helly families of maximal size
- Radius, diameter, and minimum degree
- Covering graphs: The covering problem solved
- On the Ramsey problem for multicolor bipartite graphs
- A two-person game on graphs where each player tries to encircle his opponent's men
- Cycle factors in dense graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3852212)
