AbstractIt is shown that all Hanoi and Sierpiński graphs are in edge- and total coloring class 1, except those isomorphic to a complete graph of odd or even order, respectively. New proofs for their classification with respect to planarity are also given
Pascal Knows Hanoi is an exposition of the article Towers and Triangles of Professor Claus by David ...
AbstractTutte made the conjecture in 1966 that every 2-connected cubic graph not containing the Pete...
Abstract: Jan Mycielski defined the Mycielskian graph as an extension of a graph with certain condit...
AbstractIt is shown that all Hanoi and Sierpiński graphs are in edge- and total coloring class 1, ex...
AbstractVertex-colorings, edge-colorings and total-colorings of the Sierpiński gasket graphs Sn, the...
Vertex-colorings, edge-colorings and total-colorings of the Sierpiński gasket graphs Sn, the Sierpiń...
In this paper we use the classical notion of weak Mycielskian M′(G) of a graph G and the following s...
Metric properties of Hanoi graphs Hnp are not as well understood as those of the closely related, bu...
A vertex coloring of a graph $G$ is $k \textit{-nonrepetitive}$ if one cannot find a periodic sequen...
With respect to specific cycle-related problems, edge-colored graphs can be considered as a generali...
AbstractThe Total Coloring Conjecture, in short, TCC, says that every simple graph is (Δ+2)-totally-...
An edge-colored graph is a graph with each edge assigned a color. A properly colored cycle ( or PC c...
An edge coloring of a graph G is called an edge covering coloring if each color appears at each vert...
For graph G of order n a maximal edge-coloring is a proper partial coloring with fixed number of col...
Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so...
Pascal Knows Hanoi is an exposition of the article Towers and Triangles of Professor Claus by David ...
AbstractTutte made the conjecture in 1966 that every 2-connected cubic graph not containing the Pete...
Abstract: Jan Mycielski defined the Mycielskian graph as an extension of a graph with certain condit...
AbstractIt is shown that all Hanoi and Sierpiński graphs are in edge- and total coloring class 1, ex...
AbstractVertex-colorings, edge-colorings and total-colorings of the Sierpiński gasket graphs Sn, the...
Vertex-colorings, edge-colorings and total-colorings of the Sierpiński gasket graphs Sn, the Sierpiń...
In this paper we use the classical notion of weak Mycielskian M′(G) of a graph G and the following s...
Metric properties of Hanoi graphs Hnp are not as well understood as those of the closely related, bu...
A vertex coloring of a graph $G$ is $k \textit{-nonrepetitive}$ if one cannot find a periodic sequen...
With respect to specific cycle-related problems, edge-colored graphs can be considered as a generali...
AbstractThe Total Coloring Conjecture, in short, TCC, says that every simple graph is (Δ+2)-totally-...
An edge-colored graph is a graph with each edge assigned a color. A properly colored cycle ( or PC c...
An edge coloring of a graph G is called an edge covering coloring if each color appears at each vert...
For graph G of order n a maximal edge-coloring is a proper partial coloring with fixed number of col...
Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so...
Pascal Knows Hanoi is an exposition of the article Towers and Triangles of Professor Claus by David ...
AbstractTutte made the conjecture in 1966 that every 2-connected cubic graph not containing the Pete...
Abstract: Jan Mycielski defined the Mycielskian graph as an extension of a graph with certain condit...
DOI
Add to ORKG