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
AbstractThe total chromatic number χT(G) of a graph G is the least number of colours needed to colou...
AbstractThe total chromatic number ξT(G) of a graph G is the least number of colours needed to colou...
The authors investigate Ramsey-type extremal problems for finite graphs. In Section 1, anti-Ramsey n...
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...
AbstractFor positive integers n and r we define the Häggkvist–Hell graph, Hn:r, to be the graph whos...
A vertex coloring c : V(G) → of a non-trivial connected graph G is called a sigma coloring if σ(u) ...
AbstractIt is proved that ifGis a planar graph with total (vertex–edge) chromatic number χ″, maximum...
Metric properties of Hanoi graphs Hnp are not as well understood as those of the closely related, bu...
In 1977, Wegner conjectured that the chromatic number of the square of every planar graph~$G$ with m...
AbstractLet f(k) be the largest number such that each k-regular bipartite graph with 2n vertices has...
This thesis investigates a variety of different problems within the field of Graph Theory. Half of t...
AbstractWe describe several variants of the norm-graphs introduced by Kollár, Rónyai, and Szabó and ...
The Tower of Hanoi puzzle with its disks and poles is familiar to students in mathematics and comput...
Recently, Alon introduced the notion of an $H$-code for a graph $H$: a collection of graphs on verte...
AbstractThe total chromatic number χT(G) of a graph G is the least number of colours needed to colou...
AbstractThe total chromatic number ξT(G) of a graph G is the least number of colours needed to colou...
The authors investigate Ramsey-type extremal problems for finite graphs. In Section 1, anti-Ramsey n...
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...
AbstractFor positive integers n and r we define the Häggkvist–Hell graph, Hn:r, to be the graph whos...
A vertex coloring c : V(G) → of a non-trivial connected graph G is called a sigma coloring if σ(u) ...
AbstractIt is proved that ifGis a planar graph with total (vertex–edge) chromatic number χ″, maximum...
Metric properties of Hanoi graphs Hnp are not as well understood as those of the closely related, bu...
In 1977, Wegner conjectured that the chromatic number of the square of every planar graph~$G$ with m...
AbstractLet f(k) be the largest number such that each k-regular bipartite graph with 2n vertices has...
This thesis investigates a variety of different problems within the field of Graph Theory. Half of t...
AbstractWe describe several variants of the norm-graphs introduced by Kollár, Rónyai, and Szabó and ...
The Tower of Hanoi puzzle with its disks and poles is familiar to students in mathematics and comput...
Recently, Alon introduced the notion of an $H$-code for a graph $H$: a collection of graphs on verte...
AbstractThe total chromatic number χT(G) of a graph G is the least number of colours needed to colou...
AbstractThe total chromatic number ξT(G) of a graph G is the least number of colours needed to colou...
The authors investigate Ramsey-type extremal problems for finite graphs. In Section 1, anti-Ramsey n...
DOI
Add to ORKG