AbstractA partial q-coloring of a graph is a family of q disjoint stable sets, each one representing a “color”; the largest number of colored vertices in a partial q-coloring is a number αq(G), extension of the stability number α(G)=α1(G). In this note, we investigate the possibilities, for 1⩽q⩽γ(G) , to express αq(G) by a minimax equality
A complete k-coloring of a graph G=(V,E) is an assignment φ:V→{1,⋯,k} of colors to the vertices such...
Fix positive integers p and q with 2 ≤ q ≤ (p2). An edge coloring of the complete graph Kn is said t...
Let Q(n, χ) denote the minimum clique size an n-vertex graph can have if its chromatic number is χ. ...
AbstractA partial q-coloring of a graph is a family of q disjoint stable sets, each one representing...
AbstractThis paper examines extensions of a min-max equality (stated in C Berge, Part I) for the max...
AbstractLet us denote by α(G) the size of a maximum stable set, and by μ(G) the size of a maximum ma...
AbstractLet G be a graph. A minimal coloring of G is a coloring which has the smallest possible sum ...
Let us call a G (H,k) graph vertex stable if it contains a subgraph H ever after removing any of its...
Every graph G contains a minimum vertex-coloring with the property that at least one color class of ...
A graph G is a (Kq, k) stable graph (q ≥ 3) if it contains a Kq after deleting any subset of k verti...
Let PG(q) denote the number of proper q-colorings of a graph G. This function, called the chromatic ...
We prove the following min-max relations. Let G be an undirected graph, without isolated nodes, not ...
Let q be a positive integer. Many graphs admit a partial coloring with q colors and a clique partiti...
[[abstract]]A proper vertex coloring of a graph G is a partition \{A_1,A_2,\ldots ,A_k\} of the ve...
AbstractEvery graph G contains a minimum vertex-coloring with the property that at least one color c...
A complete k-coloring of a graph G=(V,E) is an assignment φ:V→{1,⋯,k} of colors to the vertices such...
Fix positive integers p and q with 2 ≤ q ≤ (p2). An edge coloring of the complete graph Kn is said t...
Let Q(n, χ) denote the minimum clique size an n-vertex graph can have if its chromatic number is χ. ...
AbstractA partial q-coloring of a graph is a family of q disjoint stable sets, each one representing...
AbstractThis paper examines extensions of a min-max equality (stated in C Berge, Part I) for the max...
AbstractLet us denote by α(G) the size of a maximum stable set, and by μ(G) the size of a maximum ma...
AbstractLet G be a graph. A minimal coloring of G is a coloring which has the smallest possible sum ...
Let us call a G (H,k) graph vertex stable if it contains a subgraph H ever after removing any of its...
Every graph G contains a minimum vertex-coloring with the property that at least one color class of ...
A graph G is a (Kq, k) stable graph (q ≥ 3) if it contains a Kq after deleting any subset of k verti...
Let PG(q) denote the number of proper q-colorings of a graph G. This function, called the chromatic ...
We prove the following min-max relations. Let G be an undirected graph, without isolated nodes, not ...
Let q be a positive integer. Many graphs admit a partial coloring with q colors and a clique partiti...
[[abstract]]A proper vertex coloring of a graph G is a partition \{A_1,A_2,\ldots ,A_k\} of the ve...
AbstractEvery graph G contains a minimum vertex-coloring with the property that at least one color c...
A complete k-coloring of a graph G=(V,E) is an assignment φ:V→{1,⋯,k} of colors to the vertices such...
Fix positive integers p and q with 2 ≤ q ≤ (p2). An edge coloring of the complete graph Kn is said t...
Let Q(n, χ) denote the minimum clique size an n-vertex graph can have if its chromatic number is χ. ...
DOI
Add to ORKG