Let G = (V, E) be a graph and k greater-than-or-equal-to 2 be an integer. A set S subset-of V is k-independent if every component in the subgraph S] induced by S has order at most k - 1. The general chromatic number chi(k)(G) of G is the minimum order n of a partition P of the set V such that each set V(i) in P is k-independent. This paper develops properties of chi(k)(G) which are generalizations of well-known properties of chromatic number
Given a graph G, an independent set I(G) is a subset of the vertices of G such that no two vertices ...
Given a graph G, an independent set I(G) is a subset of the vertices of G such that no two vertices ...
The achromatic number Ã(G) of a graph G = (V;E) is the maximum k such that V has a partition V1; V2;...
AbstractLet G=(V,E) be a graph and k⩾2 be an integer. A set S⊂V is k-independent if every component ...
For a graph G=G(V,E), a set S⊂V is k-independent if every component in the induced subgraph on S has...
AbstractLet χ(G) be the chromatic number of a graph G=(V,E), and k⩾1 be an integer. The general chro...
Let G be a graph with V=VG. A nonempty subset S of V is called an independent set of G if no two dis...
AbstractGiven an independence system (E,P), the Minimum Partition Problem (MPP) seeks a partition of...
Let k be a positive integer and G = (V,E) a graph of order n. A subset S of V is a k-independent set...
Given a simple graph G = (V, E), a subset U of V is called a clique if it induces a complete subgrap...
Let G = (V,E) be a graph and k > 0 an integer. A k-independent set S V is a set of vertices such t...
AbstractIn a graph G=(V,E) of order n and maximum degree Δ, a subset S of vertices is a k-independen...
AbstractOhba has conjectured that if G is a k-chromatic graph with at most 2k+1 vertices, then the l...
AbstractThe subchromatic number XS(G) of a graph G=(V,E) is the smallest order k of a partition {V1,...
AbstractThe achromatic number ψ(G) of a graph G = (V, E) is the maximum k such that V has a partitio...
Given a graph G, an independent set I(G) is a subset of the vertices of G such that no two vertices ...
Given a graph G, an independent set I(G) is a subset of the vertices of G such that no two vertices ...
The achromatic number Ã(G) of a graph G = (V;E) is the maximum k such that V has a partition V1; V2;...
AbstractLet G=(V,E) be a graph and k⩾2 be an integer. A set S⊂V is k-independent if every component ...
For a graph G=G(V,E), a set S⊂V is k-independent if every component in the induced subgraph on S has...
AbstractLet χ(G) be the chromatic number of a graph G=(V,E), and k⩾1 be an integer. The general chro...
Let G be a graph with V=VG. A nonempty subset S of V is called an independent set of G if no two dis...
AbstractGiven an independence system (E,P), the Minimum Partition Problem (MPP) seeks a partition of...
Let k be a positive integer and G = (V,E) a graph of order n. A subset S of V is a k-independent set...
Given a simple graph G = (V, E), a subset U of V is called a clique if it induces a complete subgrap...
Let G = (V,E) be a graph and k > 0 an integer. A k-independent set S V is a set of vertices such t...
AbstractIn a graph G=(V,E) of order n and maximum degree Δ, a subset S of vertices is a k-independen...
AbstractOhba has conjectured that if G is a k-chromatic graph with at most 2k+1 vertices, then the l...
AbstractThe subchromatic number XS(G) of a graph G=(V,E) is the smallest order k of a partition {V1,...
AbstractThe achromatic number ψ(G) of a graph G = (V, E) is the maximum k such that V has a partitio...
Given a graph G, an independent set I(G) is a subset of the vertices of G such that no two vertices ...
Given a graph G, an independent set I(G) is a subset of the vertices of G such that no two vertices ...
The achromatic number Ã(G) of a graph G = (V;E) is the maximum k such that V has a partition V1; V2;...
DOI
Add to ORKG