AbstractStahl's concept of k-tuple coloring the nodes of a graph is extended to specify that adjacent nodes must have i colors in common. Complete results for a minimum such coloring are obtained for bipartite graphs and odd cycles. Partial results are shown for complete graphs
For graph classes \wp_1,...,\wp_k, Generalized Graph Coloring is the problem of deciding whether the...
AbstractWe give a necessary and sufficient condition for the existence of near-optimal Nkr-colorings...
In a proper k-coloring of a k-chromatic graph, for every two distinct colors there are always adjace...
Stahl\u27s concept of k-tuple coloring the nodes of a graph is extended to specify that adjacent nod...
AbstractStahl's concept of k-tuple coloring the nodes of a graph is extended to specify that adjacen...
AbstractThis paper studies proper k-tuple edge-colorings of graphs that distinguish neighboring vert...
SIGLETIB Hannover: RO 3476(29) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informa...
AbstractIn their papers (Technical Report CS-TR 50, University of Central Florida, 1980; J. Combin. ...
AbstractThe n-tuple graph coloring, which assigns to each vertex n colors, is defined together with ...
In the (k,i)-coloring problem, we aim to assign sets of colors of size k to the vertices of a graph ...
A k-tuple coloring of a graph G assigns a set of k colors to each vertex of G such that if two verti...
AbstractAn r-tuple coloring of a graph is one in which r colors are assigned to each point of the gr...
AMS Subject Classication: 05C15 Abstract. For k 1, we consider interleaved k-tuple colorings of the...
An (r, λ) overlap colouring of a graph G has r colours at each vertex, any two adjacent vertices sha...
An edge-colored graph is a graph with each edge assigned a color. A properly colored cycle ( or PC c...
For graph classes \wp_1,...,\wp_k, Generalized Graph Coloring is the problem of deciding whether the...
AbstractWe give a necessary and sufficient condition for the existence of near-optimal Nkr-colorings...
In a proper k-coloring of a k-chromatic graph, for every two distinct colors there are always adjace...
Stahl\u27s concept of k-tuple coloring the nodes of a graph is extended to specify that adjacent nod...
AbstractStahl's concept of k-tuple coloring the nodes of a graph is extended to specify that adjacen...
AbstractThis paper studies proper k-tuple edge-colorings of graphs that distinguish neighboring vert...
SIGLETIB Hannover: RO 3476(29) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informa...
AbstractIn their papers (Technical Report CS-TR 50, University of Central Florida, 1980; J. Combin. ...
AbstractThe n-tuple graph coloring, which assigns to each vertex n colors, is defined together with ...
In the (k,i)-coloring problem, we aim to assign sets of colors of size k to the vertices of a graph ...
A k-tuple coloring of a graph G assigns a set of k colors to each vertex of G such that if two verti...
AbstractAn r-tuple coloring of a graph is one in which r colors are assigned to each point of the gr...
AMS Subject Classication: 05C15 Abstract. For k 1, we consider interleaved k-tuple colorings of the...
An (r, λ) overlap colouring of a graph G has r colours at each vertex, any two adjacent vertices sha...
An edge-colored graph is a graph with each edge assigned a color. A properly colored cycle ( or PC c...
For graph classes \wp_1,...,\wp_k, Generalized Graph Coloring is the problem of deciding whether the...
AbstractWe give a necessary and sufficient condition for the existence of near-optimal Nkr-colorings...
In a proper k-coloring of a k-chromatic graph, for every two distinct colors there are always adjace...
DOI
Add to ORKG