Literatura científica selecionada sobre o tema "Odd colouring"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Índice
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Odd colouring".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Odd colouring"
KANG, ROSS J., e FRANÇOIS PIROT. "Distance Colouring Without One Cycle Length". Combinatorics, Probability and Computing 27, n.º 5 (25 de março de 2018): 794–807. http://dx.doi.org/10.1017/s0963548318000068.
Texto completo da fonteZELENYUK, YEVHEN, e YULIYA ZELENYUK. "COUNTING SYMMETRIC BRACELETS". Bulletin of the Australian Mathematical Society 89, n.º 3 (22 de agosto de 2013): 431–36. http://dx.doi.org/10.1017/s0004972713000701.
Texto completo da fonteKang, Dong Yeap, e Sang-Il Oum. "Improper colouring of graphs with no odd clique minor". Combinatorics, Probability and Computing 28, n.º 5 (4 de fevereiro de 2019): 740–54. http://dx.doi.org/10.1017/s0963548318000548.
Texto completo da fonteKAWARABAYASHI, KEN-ICHI. "A Weakening of the Odd Hadwiger's Conjecture". Combinatorics, Probability and Computing 17, n.º 6 (novembro de 2008): 815–21. http://dx.doi.org/10.1017/s0963548308009462.
Texto completo da fonteBOUSQUET, NICOLAS, LOUIS ESPERET, ARARAT HARUTYUNYAN e RÉMI DE JOANNIS DE VERCLOS. "Exact Distance Colouring in Trees". Combinatorics, Probability and Computing 28, n.º 2 (24 de julho de 2018): 177–86. http://dx.doi.org/10.1017/s0963548318000378.
Texto completo da fonteBryant, Darryn, e C. A. Rodger. "On the completion of latin rectangles to symmetric latin squares". Journal of the Australian Mathematical Society 76, n.º 1 (fevereiro de 2004): 109–24. http://dx.doi.org/10.1017/s1446788700008739.
Texto completo da fonteKINNERSLEY, WILLIAM B., KEVIN G. MILANS e DOUGLAS B. WEST. "Degree Ramsey Numbers of Graphs". Combinatorics, Probability and Computing 21, n.º 1-2 (2 de fevereiro de 2012): 229–53. http://dx.doi.org/10.1017/s0963548311000617.
Texto completo da fonteStone, Phil. "Non-Mathematical Musings on Information Theory and Networked Musical Practice". Organised Sound 26, n.º 3 (dezembro de 2021): 327–32. http://dx.doi.org/10.1017/s1355771821000418.
Texto completo da fonteJayawardene, C. J., J. N. Senadheera, K. A. S. N. Fernando e W. C. W. Navaratna. "On Star-critical (K1,n, K1,m + e) Ramsey Numbers". Annals of Pure and Applied Mathematics 22, n.º 02 (2020): 75–82. http://dx.doi.org/10.22457/apam.v22n2a02702.
Texto completo da fonteChistikov, Dmitry, Olga Goulko, Adrian Kent e Mike Paterson. "Globe-hopping". Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 476, n.º 2238 (junho de 2020): 20200038. http://dx.doi.org/10.1098/rspa.2020.0038.
Texto completo da fonteTeses / dissertações sobre o assunto "Odd colouring"
Ouyang, Qiancheng. "Some colouring problems in edge/vertex-coloured graphs : Structural and extremal studies". Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPASG060.
Texto completo da fonteGraph colouring is one of the best known, popular and extensively researched subject in the field of graph theory, having a wide literature with approaches from many domains and a lot of problems, which are still open and studied by various mathematicians and computer scientists along the world. The Four Colour Problem, originating the study of graph colouring, was one of the central problem in graph theory in the last century, which asks if it is possible to colour every planar graph properly by four colours. Despite the theoretical origin, the graph colouring has found many applications in practice like scheduling, frequency assignment problems, segmentation, etc. The Four Colour Problem is a significant one among many problems in chromatic graph theory, from which many variants and generalizations have been proposed. Firstly, in this thesis, we aim to optimize the strategy to colour the vertex of graphs and hypergraphs with some given constraints, which combines the concept of proper colouring and representative element of some vertex subsets. On the other hand, according to the subject to be coloured, a large amount of research and problems of edge-coloured graphs have emerged, which have important applications to biology and web technologies. We provide some analogous results for some connectivity issues—to describe graphs whose edges are assigned enough colours, that guarantee spanning trees or cycles of a specific chromatic structure
Livros sobre o assunto "Odd colouring"
Barnes, Jaxson. Odd Squad Waves Diagonals Lines Swirls Dots Coloring Book: Awesome Illustrations Spirograph Styles Colouring Books for Adult. Independently Published, 2021.
Encontre o texto completo da fonteBarnes, Jaxson. Odd Squad Waves Diagonals Lines Swirls Dots Coloring Book: Premium Spirograph Styles Colouring Books for Adult and Kid! Independently Published, 2021.
Encontre o texto completo da fontePublishing, Skellee. Colouring and Brain Teaser Activities for Kids Ages 6-8 8-10 UK Version - Secret Codes - I Spy - Sudoku - Mazes - Odd One Out - Word Search - Scramble: An Activity Book Packed with over 100 Puzzles. Independently Published, 2020.
Encontre o texto completo da fonteCapítulos de livros sobre o assunto "Odd colouring"
"colouring | coloring, adj." In Oxford English Dictionary. 3a ed. Oxford University Press, 2023. http://dx.doi.org/10.1093/oed/1128518023.
Texto completo da fonte"colouring | coloring, n." In Oxford English Dictionary. 3a ed. Oxford University Press, 2023. http://dx.doi.org/10.1093/oed/4746329854.
Texto completo da fonte"dead-colouring | dead-coloring, n." In Oxford English Dictionary. 3a ed. Oxford University Press, 2024. http://dx.doi.org/10.1093/oed/1170837837.
Texto completo da fonte"colouring in | coloring in, n." In Oxford English Dictionary. 3a ed. Oxford University Press, 2023. http://dx.doi.org/10.1093/oed/8578639611.
Texto completo da fonte"colouring matter | coloring matter, n." In Oxford English Dictionary. 3a ed. Oxford University Press, 2023. http://dx.doi.org/10.1093/oed/7325500347.
Texto completo da fonte"colourish, n." In Oxford English Dictionary. 3a ed. Oxford University Press, 2023. http://dx.doi.org/10.1093/oed/7103047581.
Texto completo da fonteKrishnamurti, Bhadriraju, e Murray B. Emeneau. "Evidence for a Laryngeal *H in Proto-Dravidian". In Comparative Dravidian Linguistics, 307–23. Oxford University PressOxford, 2001. http://dx.doi.org/10.1093/oso/9780198241225.003.0019.
Texto completo da fonte"colourize | colorize, v." In Oxford English Dictionary. 3a ed. Oxford University Press, 2023. http://dx.doi.org/10.1093/oed/6429298936.
Texto completo da fonte"colourist | colorist, n." In Oxford English Dictionary. 3a ed. Oxford University Press, 2023. http://dx.doi.org/10.1093/oed/4842462689.
Texto completo da fonte"colourant | colorant, n." In Oxford English Dictionary. 3a ed. Oxford University Press, 2023. http://dx.doi.org/10.1093/oed/5545409665.
Texto completo da fonteTrabalhos de conferências sobre o assunto "Odd colouring"
Bernardi, João Pedro W., Sheila M. De Almeida e Leandro M. Zatesko. "On Total and Edge-colouring of Proper Circular-arc Graphs". In III Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2018. http://dx.doi.org/10.5753/etc.2018.3557.
Texto completo da fonte