J. Harris, List-colourings of graphs , Graphs and Comb., 1 (1985), pp. 115–127. MATHB. Bollobâs and A.J. Harris, List-colourings of graphs , Graphs and Combinatorics 1 (1985), 115–127. MathSciNet MATHB. Bollobás, A.J. Harris , List colorings of graphs, Graphs and ...
Tarsi Colorings and orientations of graphs Combinatorica, 12 (1992), pp. 125-134 View in ScopusGoogle Scholar [3] P. Erdős, A.L. Rubin, H. Taylor Choosability in Graphs Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing, Arcata, California (1979), pp...
M. Voigt, List colourings of planar graphs, Discrete Math. 120 (1993) 215-219.Margit Voigt.List colorings of planar graph,1993Voigt, M.: List colourings of planar graphs. Discrete Math., 120, 215-219 (1993)M. Voigt, List colourings of planar graphs, Discrete Math., 120(1-3):215...
Some types of list colourings of graphsA.O. Waller
Mih´ok. Generalized list colour- ings of graphs. Discuss. Math. Graph Theory, 15(2):185-193, 1995.M. Borowiecki, I. Broere, and P. Mih´ok. On generalized list colourings of graphs. Discuss. Math. Gr...
doi:10.1016/j.disc.2016.05.034Fabrici, IgorJendrol’, StanislavVoigt, MargitElsevier B.V.Discrete MathematicsI. Fabrici, S. Jendroľ, M. Voigt, Facial list colourings of plane graphs, Discrete Math. 339 (2016), 2826-2831.
Balanced list edge-colourings of bipartite graphsNo AbstractFleiner, T. s.Frank, A. s.ELECTRONIC NOTES IN DISCRETE MATHEMATICS
An H-colouring of a graph G is a homomorphism from G to H (a map from the vertices of G to the vertices of H that maps edges of G to edges of H). The "classification programme" in computational complexity aims to classify graphs H according to the difficulty of algorithmic problems,...
An H-colouring of a graph G is a homomorphism from G to H (a map from the vertices of G to the vertices of H that maps edges of G to edges of H). The "classification programme" in computational complexity aims to classify graphs H according to the difficulty of algorithmic problems,...
In particular, there exist balanced list edge-colourings for bipartite graphs. In the light of our result, it is a natural question whether a certain generalization of the well-known list colouring conjecture is true.doi:10.1016/j.endm.2010.05.106Tamás Fleiner...