13 citations · 30 across the 5 of their papers we have counts for
4 papers · 1 filter
Signified chromatic number of grids is at most 9
Janusz Dybizbanski
A signified graph is a pair where is a graph, and is a set of edges marked with ''. Other edges are marked with ''. A signified coloring of the signified gra…
Hamiltonian cycles and paths in hypercubes with disjoint faulty edges
Janusz Dybizbański, Andrzej Szepietowski
We consider hypercubes with pairwise disjoint faulty edges. An -dimensional hypercube is an undirected graph with nodes, each labeled with a distinct binary strings…
Hamiltonian cycles in hypercubes with faulty edges
Janusz Dybizbański, Andrzej Szepietowski
Szepietowski [A. Szepietowski, Hamiltonian cycles in hypercubes with faulty edges, Information Sciences, 215 (2012) 75--82] observed that the hypercube is not Hamilton…
Oriented chromatic number of Halin graphs
Janusz Dybizbański, Andrzej Szepietowski
Oriented chromatic number of an oriented graph is the minimum order of an oriented graph such that admits a homomorphism to . The oriented chromatic number of an uno…