Log in

Relevant bibliographies by topics / List colouring / Journal articles

To see the other types of publications on this topic, follow the link: List colouring.

Journal articles on the topic 'List colouring'

Author: Grafiati

Published: 4 June 2021

Last updated: 18 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'List colouring.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Reed, Bruce. "The list colouring constants." Journal of Graph Theory 31, no. 2 (1999): 149–53. http://dx.doi.org/10.1002/(sici)1097-0118(199906)31:2<149::aid-jgt8>3.0.co;2-#.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Bu, Yuehua, Stephen Finbow, Daphne Der-Fen Liu, and Xuding Zhu. "List backbone colouring of graphs." Discrete Applied Mathematics 167 (April 2014): 45–51. http://dx.doi.org/10.1016/j.dam.2013.11.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Havet, Frédéric, Jan van den Heuvel, Colin McDiarmid, and Bruce Reed. "List Colouring Squares of Planar Graphs." Electronic Notes in Discrete Mathematics 29 (August 2007): 515–19. http://dx.doi.org/10.1016/j.endm.2007.07.079.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

HAXELL, P. E. "A Note on Vertex List Colouring." Combinatorics, Probability and Computing 10, no. 4 (2001): 345–47. http://dx.doi.org/10.1017/s0963548301004758.

Full text

Abstract:

Let k be a positive integer and let G be a graph. Suppose a list S(v) of positive integers is assigned to each vertex v, such that(1) [mid ]S(v)[mid ] = 2k for each vertex v of G, and(2) for each vertex v, and each c ∈ S(v), the number of neighbours w of v for which c ∈ S(w) is at most k.Then we prove that there exists a proper vertex colouring f of G such that f(v) ∈ S(v) for each v ∈ V(G). This proves a weak version of a conjecture of Reed.

APA, Harvard, Vancouver, ISO, and other styles

5

SUBRAMANIAN, C. R. "List Set Colouring: Bounds and Algorithms." Combinatorics, Probability and Computing 16, no. 01 (2006): 145. http://dx.doi.org/10.1017/s0963548306007735.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Zhu, Xuding. "Multiple list colouring of planar graphs." Journal of Combinatorial Theory, Series B 122 (January 2017): 794–99. http://dx.doi.org/10.1016/j.jctb.2016.09.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Qi, Hao. "Bounds on partial online list colouring." Information Processing Letters 127 (November 2017): 23–26. http://dx.doi.org/10.1016/j.ipl.2017.06.009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

šKREKOVSKI, R. "A Grötzsch-Type Theorem for List Colourings with Impropriety One." Combinatorics, Probability and Computing 8, no. 5 (1999): 493–507. http://dx.doi.org/10.1017/s096354839900396x.

Full text

Abstract:

A graph G is m-choosable with impropriety d, or simply (m, d)*-choosable, if, for every list assignment L, where [mid ]L(v)[mid ][ges ]m for every v∈V(G), there exists an L-colouring of G such that each vertex of G has at most d neighbours coloured with the same colour as itself. We prove a Grötzsch-type theorem for list colourings with impropriety one, that is, the (3, 1)*-choosability for triangle-free planar graphs; in the proof the method of extending a precolouring of a 4- or 5-cycle is used.

APA, Harvard, Vancouver, ISO, and other styles

9

šKREKOVSKI, R. "List Improper Colourings of Planar Graphs." Combinatorics, Probability and Computing 8, no. 3 (1999): 293–99. http://dx.doi.org/10.1017/s0963548399003752.

Full text

Abstract:

A graph G is m-choosable with impropriety d, or simply (m, d)*-choosable, if for every list assignment L, where [mid ]L(v)[mid ][ges ]m for every v∈V(G), there exists an L-colouring of G such that each vertex of G has at most d neighbours coloured with the same colour as itself. We show that every planar graph is (3, 2)*-choosable and every outerplanar graph is (2, 2)*-choosable. We also propose some interesting problems about this colouring.

APA, Harvard, Vancouver, ISO, and other styles

10

Amini, Omid, and Bruce Reed. "List Colouring Constants of Triangle Free Graphs." Electronic Notes in Discrete Mathematics 30 (February 2008): 135–40. http://dx.doi.org/10.1016/j.endm.2008.01.024.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

De Luca Cardillo, Dorotea, та Nicola Mione. "k L-list λ colouring of graphs". European Journal of Operational Research 106, № 1 (1998): 160–64. http://dx.doi.org/10.1016/s0377-2217(98)00299-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Reed, Bruce, and Benny Sudakov. "Asymptotically the List Colouring Constants Are 1." Journal of Combinatorial Theory, Series B 86, no. 1 (2002): 27–37. http://dx.doi.org/10.1006/jctb.2002.2110.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Jiang, Yiting, and Xuding Zhu. "Multiple list colouring triangle free planar graphs." Journal of Combinatorial Theory, Series B 137 (July 2019): 112–17. http://dx.doi.org/10.1016/j.jctb.2018.12.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Drgas-Burchardt, Ewa, and Agata Drzystek. "Improper sum-list colouring of 2-trees." Discrete Applied Mathematics 267 (August 2019): 73–84. http://dx.doi.org/10.1016/j.dam.2019.07.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Drgas-Burchardt, Ewa, and Agata Drzystek. "General and acyclic sum-list-colouring of graphs." Applicable Analysis and Discrete Mathematics 10, no. 2 (2016): 479–500. http://dx.doi.org/10.2298/aadm161011026d.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

胡, 建章. "Online List Colouring of Graphs with Crossing Number." Operations Research and Fuzziology 08, no. 02 (2018): 45–53. http://dx.doi.org/10.12677/orf.2018.82006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

WATERS, R. J. "CONSECUTIVE LIST COLOURING AND A NEW GRAPH INVARIANT." Journal of the London Mathematical Society 73, no. 03 (2006): 565–85. http://dx.doi.org/10.1112/s0024610706022666.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Laurent, Benoit, and Jin Kao Hao. "List-graph colouring for multiple depot vehicle scheduling." International Journal of Mathematics in Operational Research 1, no. 1/2 (2009): 228. http://dx.doi.org/10.1504/ijmor.2009.022883.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Harrelson, Joshua, Jessica McDonald, and Gregory J. Puleo. "List-edge-colouring planar graphs with precoloured edges." European Journal of Combinatorics 75 (January 2019): 55–65. http://dx.doi.org/10.1016/j.ejc.2018.07.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Xu, Rongxing, Yeong-Nan Yeh, and Xuding Zhu. "List colouring of graphs and generalized Dyck paths." Discrete Mathematics 341, no. 3 (2018): 810–19. http://dx.doi.org/10.1016/j.disc.2017.11.022.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Esperet, Louis, Ross J. Kang, and Stéphan Thomassé. "Separation Choosability and Dense Bipartite Induced Subgraphs." Combinatorics, Probability and Computing 28, no. 5 (2019): 720–32. http://dx.doi.org/10.1017/s0963548319000026.

Full text

Abstract:

AbstractWe study a restricted form of list colouring, for which every pair of lists that correspond to adjacent vertices may not share more than one colour. The optimal list size such that a proper list colouring is always possible given this restriction, we call separation choosability. We show for bipartite graphs that separation choosability increases with (the logarithm of) the minimum degree. This strengthens results of Molloy and Thron and, partially, of Alon. One attempt to drop the bipartiteness assumption precipitates a natural class of Ramsey-type questions, of independent interest.

APA, Harvard, Vancouver, ISO, and other styles

22

Zhao, Huanhua, та Xuding Zhu. "$$(2+\epsilon )$$ ( 2 + ϵ ) -Nonrepetitive List Colouring of Paths". Graphs and Combinatorics 32, № 4 (2015): 1635–40. http://dx.doi.org/10.1007/s00373-015-1652-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Hetherington, Timothy J., and Douglas R. Woodall. "List-colouring the square of a K4-minor-free graph." Discrete Mathematics 308, no. 18 (2008): 4037–43. http://dx.doi.org/10.1016/j.disc.2007.07.102.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Brettell, Nick, Jake Horsfield, Andrea Munaro, and Daniël Paulusma. "List k-colouring P-free graphs: A Mim-width perspective." Information Processing Letters 173 (January 2022): 106168. http://dx.doi.org/10.1016/j.ipl.2021.106168.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

SAJITH, G., and SANJEEV SAXENA. "PARALLEL VERTEX COLOURING OF INTERVAL GRAPHS." International Journal of Foundations of Computer Science 10, no. 01 (1999): 19–31. http://dx.doi.org/10.1142/s0129054199000034.

Full text

Abstract:

Evidence is given to suggest that minimally vertex colouring an interval graph may not be in NC 1. This is done by showing that 3-colouring a linked list is NC 1-reducible to minimally colouring an interval graph. However, it is shown that an interval graph with a known interval representation and an O(1) chromatic number can be minimally coloured in NC 1. For the CRCW PRAM model, an o( log n) time, polynomial processors algorithm is obtained for minimally colouring an interval graph with o( log n) chromatic number and a known interval representation. In particular, when the chromatic number i

APA, Harvard, Vancouver, ISO, and other styles

26

Drgas-Burchardt, Ewa, and Agata Drzystek. "Acyclic sum-list-colouring of grids and other classes of graphs." Opuscula Mathematica 37, no. 4 (2017): 535. http://dx.doi.org/10.7494/opmath.2017.37.4.535.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Huang, Po-Yi, Tsai-Lien Wong, and Xuding Zhu. "Application of polynomial method to on-line list colouring of graphs." European Journal of Combinatorics 33, no. 5 (2012): 872–83. http://dx.doi.org/10.1016/j.ejc.2011.09.020.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Drgas-Burchardt, Ewa, Janusz Dybizbański, Hanna Furmańczyk, and Elżbieta Sidorowicz. "Equitable list vertex colourability and arboricity of grids." Filomat 32, no. 18 (2018): 6353–74. http://dx.doi.org/10.2298/fil1818353d.

Full text

Abstract:

A graph G is equitably k-list arborable if for any k-uniform list assignment L, there is an equitable L-colouring of G whose each colour class induces an acyclic graph. The smallest number k admitting such a coloring is named equitable list vertex arboricity and is denoted by ?=l (G). Zhang in 2016 posed the conjecture that if k ? ?(?(G) + 1)/2? then G is equitably k-list arborable. We give some new tools that are helpful in determining values of k for which a general graph is equitably k-list arborable. We use them to prove the Zhang?s conjecture for d-dimensional grids where d 2 {2,3,4} and

APA, Harvard, Vancouver, ISO, and other styles

29

Tuza, Zs, and M. Voigt. "A note on planar 5-list colouring: non-extendability at distance 4." Discrete Mathematics 251, no. 1-3 (2002): 169–72. http://dx.doi.org/10.1016/s0012-365x(01)00338-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Tverberg, Helge. "On a Lovász-type lemma, applied to Brooks’ theorem for list-colouring." Discrete Mathematics 311, no. 17 (2011): 1995–97. http://dx.doi.org/10.1016/j.disc.2011.05.021.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Tosuni, Besjana. "Graph Coloring Problems in Modern Computer Science." European Journal of Interdisciplinary Studies 1, no. 2 (2015): 87. http://dx.doi.org/10.26417/ejis.v1i2.p87-95.

Full text

Abstract:

Graph coloring is one of the most important concepts in graph theory and is used in many real time applications in computer science. The main aim of this paper is to present the importance of graph coloring ideas in various areas of compute applications for researches that they can use graph coloring concepts for the research. Graph coloring used in various research areas of computer science such data mining, image segmentation, clustering, image capturing, networking etc. This papers mainly focused on important applications such as Guarding an Art Gallery, Physical layout segmentation, Round-

APA, Harvard, Vancouver, ISO, and other styles

32

Tosuni, Besjana. "Graph Coloring Problems in Modern Computer Science." European Journal of Interdisciplinary Studies 2, no. 1 (2015): 87. http://dx.doi.org/10.26417/ejis.v2i1.p87-95.

Full text

Abstract:

Graph coloring is one of the most important concepts in graph theory and is used in many real time applications in computer science. The main aim of this paper is to present the importance of graph coloring ideas in various areas of compute applications for researches that they can use graph coloring concepts for the research. Graph coloring used in various research areas of computer science such data mining, image segmentation, clustering, image capturing, networking etc. This papers mainly focused on important applications such as Guarding an Art Gallery, Physical layout segmentation, Round-

APA, Harvard, Vancouver, ISO, and other styles

33

Lang, Richard. "A Note on Total and List Edge-Colouring of Graphs of Tree-Width 3." Graphs and Combinatorics 32, no. 3 (2015): 1055–64. http://dx.doi.org/10.1007/s00373-015-1617-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Reed*, Bruce, and Benny Sudakov†. "List Colouring When The Chromatic Number Is Close To the Order Of The Graph." COMBINATORICA 25, no. 1 (2004): 117–23. http://dx.doi.org/10.1007/s00493-005-0010-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Alouani, Imane, Mohammed Oulad Bouyahya Idrissi, Mustapha Draoui, and Mustapha Bouatia. "REVIEW: FROM SCREENING TO APPLICATION OF MOROCCAN DYEING PLANTS: CHEMICAL GROUPS AND BOTANICAL DISTRIBUTION." International Journal of Pharmacy and Pharmaceutical Sciences 8, no. 10 (2016): 21. http://dx.doi.org/10.22159/ijpps.2016v8i10.12960.

Full text

Abstract:

<p>Many plants contain dyes and are used for colouring a medium. They are characterized by their content of dyes molecules. They stimulate interest because they are part of a sustainable development approach. There are several chemical families of plant dyes contained in more than 450 plants known in the world. In this article, a study based on literature allowed us to realize an inventory of the main dye plants potentially present in Morocco. A list of 117 plants was established specifying their botanical families, chemical composition, color and part of the plant used. <strong>&l

APA, Harvard, Vancouver, ISO, and other styles

36

Drgas-Burchardt, Ewa, and Elżbieta Sidorowicz. "Sum-list colouring of unions of a hypercycle and a path with at most two vertices in common." Discussiones Mathematicae Graph Theory 40, no. 3 (2020): 893. http://dx.doi.org/10.7151/dmgt.2312.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Hendrey, Kevin, and David R. Wood. "Defective and clustered choosability of sparse graphs." Combinatorics, Probability and Computing 28, no. 5 (2019): 791–810. http://dx.doi.org/10.1017/s0963548319000063.

Full text

Abstract:

AbstractAn (improper) graph colouring hasdefect dif each monochromatic subgraph has maximum degree at mostd, and hasclustering cif each monochromatic component has at mostcvertices. This paper studies defective and clustered list-colourings for graphs with given maximum average degree. We prove that every graph with maximum average degree less than (2d+2)/(d+2)kisk-choosable with defectd. This improves upon a similar result by Havet and Sereni (J. Graph Theory, 2006). For clustered choosability of graphs with maximum average degreem, no (1-ɛ)mbound on the number of colours was previously known

APA, Harvard, Vancouver, ISO, and other styles

38

Huang, Po-Yi, Tsai-Lien Wong, and Xuding Zhu. "Erratum to “Application of polynomial method to on-line list colouring of graphs” [European J. Combin. 33 (2012) 872–883]." European Journal of Combinatorics 38 (May 2014): 23. http://dx.doi.org/10.1016/j.ejc.2013.10.009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Drgas-Burchardt, Ewa, and Agata Drzystek. "Corrigendum to "Acyclic sum-list-colouring of grids and other classes of graphs" [Opuscula Math. 37, no. 4 (2017), 535-556]." Opuscula Mathematica 38, no. 6 (2018): 899. http://dx.doi.org/10.7494/opmath.2018.38.6.899.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Gribova, N. A., and L. V. Berketova. "Development of a sensory profile for a new type of processed fruit and berry products." Proceedings of the Voronezh State University of Engineering Technologies 82, no. 2 (2020): 116–23. http://dx.doi.org/10.20914/2310-1202-2020-2-116-123.

Full text

Abstract:

The article considers the principle of developing a list of descriptors to describe the sensory characteristics of processed fruit and berry products as a result of osmotic dehydration with hypertonic sucrose solution. The analytical method of organoleptic analysis - the quantitative descriptive method, was used to determine significant characteristics. Initially, the testers compiled a preliminary list of descriptors for processed products, including 54 characteristics, which are divided into groups: consistency, appearance, taste, color and aroma. After deleting synonyms, antonyms, and hedon

APA, Harvard, Vancouver, ISO, and other styles

41

Fraticelli, Fulvio, and Carla Marangoni. "[The Great grey Shrike Lanius excubitor L. of the Arrigoni degli Oddi’s ornithological collection at the Museo Civico di Zoologia, Rome (Italy)]." Rivista Italiana di Ornitologia 88, no. 1 (2018): 43–46. http://dx.doi.org/10.4081/rio.2018.405.

Full text

Abstract:

[Lanius excubitor is a polymorphic species with 12 subspecies. In the last years the taxonomy of this species has been reviewed several times. According to the literature, in Italy Lanius excubitor is a regular migrator, wintering and irregular nesting, occurring with three subspecies: L. excubitor excubitor, L. e. homeyeri and L. e. sibiricus. This paper aims at reviewing the subspecies actually occurring in Italy by analyzing the specimens preserved in the Arrigoni degli Oddi’s collection at the Museo Civico di Zoologia in Rome (Italy). The morphometrics and colouring of 66 specimens were ex

APA, Harvard, Vancouver, ISO, and other styles

42

Bollobás, B., and A. J. Harris. "List-colourings of graphs." Graphs and Combinatorics 1, no. 1 (1985): 115–27. http://dx.doi.org/10.1007/bf02582936.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Lewin-Jones, Jenny, and Mike Webb. "Ideology in Disguise: Place Name Metonyms and the Discourse of Newspaper Headlines." Sociological Research Online 18, no. 4 (2013): 167–81. http://dx.doi.org/10.5153/sro.3185.

Full text

Abstract:

‘Place metonyms’ are figures of speech which use place names as shortcuts, for example Whitehall to mean the British civil service, or Europe for the institutions of the European Union. The paper examines place metonyms in the headlines of two British newspapers, the Sun and the Guardian. Using evidence from a 12-month period in 2011–12, a headline-by-headline linguistic analysis is used to work out the denotations and wider connotations of each metonym. This critical discourse approach suggests that such place metonyms in headlines have three problematic effects: firstly they may conceal agen

APA, Harvard, Vancouver, ISO, and other styles

44

Borowiecki, Mieczysław, Ewa Drgas-Burchardt, and Peter Mihók. "Generalized list colourings of graphs." Discussiones Mathematicae Graph Theory 15, no. 2 (1995): 185. http://dx.doi.org/10.7151/dmgt.1016.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

JUVAN, M., B. MOHAR, and R. ŠKREKOVSKI. "List Total Colourings of Graphs." Combinatorics, Probability and Computing 7, no. 2 (1998): 181–88. http://dx.doi.org/10.1017/s0963548397003210.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Hilton, A. J. W., T. Slivnik, and D. S. G. Stirling. "Aspects of edge list-colourings." Discrete Mathematics 231, no. 1-3 (2001): 253–64. http://dx.doi.org/10.1016/s0012-365x(00)00322-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

SAXTON, DAVID, and ANDREW THOMASON. "List Colourings of Regular Hypergraphs." Combinatorics, Probability and Computing 21, no. 1-2 (2012): 315–22. http://dx.doi.org/10.1017/s0963548311000502.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Grytczuk, Jarosław, Jakub Przybyło, and Xuding Zhu. "Nonrepetitive list colourings of paths." Random Structures & Algorithms 38, no. 1-2 (2010): 162–73. http://dx.doi.org/10.1002/rsa.20347.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Voigt, Margit. "List colourings of planar graphs." Discrete Mathematics 306, no. 10-11 (2006): 1076–79. http://dx.doi.org/10.1016/j.disc.2006.03.027.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Voigt, Margit. "List colourings of planar graphs." Discrete Mathematics 120, no. 1-3 (1993): 215–19. http://dx.doi.org/10.1016/0012-365x(93)90579-i.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!