AbstractVertex-colorings, edge-colorings and total-colorings of the Sierpiński gasket graphs Sn, the Sierpiński graphs S(n,k), graphs S+(n,k), and graphs S++(n,k) are considered. In particular, χ″(Sn), χ′(S(n,k)), χ(S+(n,k)), χ(S++(n,k)), χ′(S+(n,k)), and χ′(S++(n,k)) are determined
Abstract Sierpiński graphs are extensively studied graphs of fractal nature with applications in top...
A total k-coloring of a graph G is a coloring of vertices and edges of G using colors of the set {1,...
Abstract: Jan Mycielski defined the Mycielskian graph as an extension of a graph with certain condit...
Vertex-colorings, edge-colorings and total-colorings of the Sierpiński gasket graphs Sn, the Sierpiń...
AbstractVertex-colorings, edge-colorings and total-colorings of the Sierpiński gasket graphs Sn, the...
Graphs ▫$S[n,k]$▫ are introduced as the graphs obtained from the Sierpiński graphs ▫$S(n,k)$▫ by con...
Obravnavana so vozliščna, povezavna in skupna barvanja grafov Sierpińskijevih rešetk ▫$S_n$▫, Sierpi...
AbstractIt is shown that all Hanoi and Sierpiński graphs are in edge- and total coloring class 1, ex...
AbstractA mapping ϕ from V(G) to {1,2,…,t} is called a path t-coloring of a graph G if each G[ϕ−1(i)...
V diplomskem delu so predstavljeni grafi Sierpińskijevega tipa, in sicer grafi Sierpińskega S(n, k),...
The Sierpiński fractal or Sierpiński gasket ∈ is a familiar object studied by specialists in dynamic...
A vertex coloring c : V(G) → of a non-trivial connected graph G is called a sigma coloring if σ(u) ...
V magistrskem delu so obravnavane in s slikovnimi zgledi predstavljene nekatere lastnosti posplošeni...
Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so...
Sierpiński graphs are studied in fractal theory and have applications in diverse areas including dyn...
Abstract Sierpiński graphs are extensively studied graphs of fractal nature with applications in top...
A total k-coloring of a graph G is a coloring of vertices and edges of G using colors of the set {1,...
Abstract: Jan Mycielski defined the Mycielskian graph as an extension of a graph with certain condit...
Vertex-colorings, edge-colorings and total-colorings of the Sierpiński gasket graphs Sn, the Sierpiń...
AbstractVertex-colorings, edge-colorings and total-colorings of the Sierpiński gasket graphs Sn, the...
Graphs ▫$S[n,k]$▫ are introduced as the graphs obtained from the Sierpiński graphs ▫$S(n,k)$▫ by con...
Obravnavana so vozliščna, povezavna in skupna barvanja grafov Sierpińskijevih rešetk ▫$S_n$▫, Sierpi...
AbstractIt is shown that all Hanoi and Sierpiński graphs are in edge- and total coloring class 1, ex...
AbstractA mapping ϕ from V(G) to {1,2,…,t} is called a path t-coloring of a graph G if each G[ϕ−1(i)...
V diplomskem delu so predstavljeni grafi Sierpińskijevega tipa, in sicer grafi Sierpińskega S(n, k),...
The Sierpiński fractal or Sierpiński gasket ∈ is a familiar object studied by specialists in dynamic...
A vertex coloring c : V(G) → of a non-trivial connected graph G is called a sigma coloring if σ(u) ...
V magistrskem delu so obravnavane in s slikovnimi zgledi predstavljene nekatere lastnosti posplošeni...
Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so...
Sierpiński graphs are studied in fractal theory and have applications in diverse areas including dyn...
Abstract Sierpiński graphs are extensively studied graphs of fractal nature with applications in top...
A total k-coloring of a graph G is a coloring of vertices and edges of G using colors of the set {1,...
Abstract: Jan Mycielski defined the Mycielskian graph as an extension of a graph with certain condit...
DOI
Add to ORKG