scientific article; zbMATH DE number 3050594

Cited in

(only showing first 100 items - show all)

Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle
Local k-colorings of graphs and hypergraphs
Intersection properties of boxes. I: An upper-bound theorem
Chromatic polynomials for regular graphs and modified wheels
Partitive hypergraphs
Intersection properties of boxes. II: Extremal families
Coefficient relationship between rook and chromatic polynomials
Stirling number identities from chromatic polynomials
A short proof of the existence of highly chromatic hypergraphs without short cycles
Turán's theorem and maximal degrees
The chromaticity of certain graphs with five triangles
Chromatic classes of 2-connected (n,n+3)-graphs with at least two triangles
Chromatic equivalence classes of certain generalized polygon trees
An exact algorithm for the partition coloring problem
Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions
Star saturation number of random graphs
On the maximum number of maximum independent sets
Chromatic capacities of graphs and hypergraphs
Many cliques with few edges and bounded maximum degree
General lemmas for Berge-Turán hypergraph problems
On Turán-good graphs
Flag complexes and homology
Some results on k-Turán-good graphs
The Lagrangian density of \(\{123, 234, 456\}\) and the Turán number of its extension
Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions
Maximizing five-cycles in \(K_r\)-free graphs
On the independent set sequence of a tree
The inductive graph dimension from the minimum edge clique cover
Hypergraph based Berge hypergraphs
DP color functions versus chromatic polynomials
Generalized Turán problems for complete bipartite graphs
An irrational Turán density via hypergraph Lagrangian densities
Generalized outerplanar Turán number of short paths
Generalized Turán densities in the hypercube
Further results on the generalized Turán number of spanning linear forests
The generalized Turán number of spanning linear forests
Supersaturation for subgraph counts
Paths of length three are \(K_{r+1}\)-Turán-good
A branch and price algorithm for list coloring problem
Some exact results for generalized Turán problems
Generalized rainbow Turán problems
Generalized Turán number for linear forests
On the Ramsey-Turán density of triangles
Joins of circulant matrices
On generalized Turán number of two disjoint cliques
The vertex Euclidean properties of graphs
Maximizing the density of \(K_t\)'s in graphs of bounded degree and clique number
A note on rainbow saturation number of paths
The energy of a simplicial complex
Generalized Turán problems for even cycles
Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph
Regular saturated graphs and sum-free sets
Independent vertex sets in the Zykov sum
Analytic methods for uniform hypergraphs
Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors
Exact bounds for some hypergraph saturation problems
The Local metric dimension of the lexicographic product of graphs
The shifting method and generalized Turán number of matchings
On fractional cut covers
Counting copies of a fixed subgraph in F-free graphs
Graph cover-saturation
The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs
Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs
Ramsey numbers for degree monotone paths
On the number of cliques in graphs with a forbidden minor
An exact algorithm for parallel machine scheduling with conflicts
Triangle-free graphs of tree-width \(t\) are \(\lceil (t+3)/2 \rceil\)-colorable
The Ramsey-Turán problem for cliques
On the super domination number of lexicographic product graphs
The maximum number of complete subgraphs in a graph with given maximum degree
Bounds on graph eigenvalues. II
Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture
Toughness in graphs -- a survey
Vertex elimination orderings for hereditary graph classes
Sur le joint d'une famille de graphes
Extremal digraphs with given clique number
The maximum number of paths of length four in a planar graph
Generalized planar Turán numbers
Generalized rainbow Turán numbers of odd cycles
The minimum number of clique-saturating edges
Generalized Turán problems for \(K_{2,t}\)
Some exact results of the generalized Turán numbers for paths
Column-wise extendible vector expressions and the relational computation of sets of sets
Cliques in graphs excluding a complete graph minor
Fractional Turan's theorem and bounds for the chromatic number
Nordhaus-Gaddum type inequalities for the distinguishing index
Triangle-free intersection graphs of line segments with large chromatic number
Extremal problems for the p-spectral radius of graphs
On saturated k-Sperner systems
An exact approach for the vertex coloring problem
Exact weighted vertex coloring via branch-and-price
Randomly colouring graphs (a combinatorial view)
Improving upper bounds for the distinguishing index
Stabilizing the distinguishing number of a graph
Patterns in Khovanov link and chromatic graph homology
The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs
Coloring intersection graphs of arc-connected sets in the plane
\(K_{s,t}\)-saturated bipartite graphs
Minimizing the number of edges in \(K_{(s,t)}\)-saturated bipartite graphs
Clique polynomials of 2-connected K₅-free chordal 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 Q5790850)