Literatura científica selecionada sobre o tema "Edge-coloured graph"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Edge-coloured graph".
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 "Edge-coloured graph"
COOPER, COLIN, e ALAN FRIEZE. "Multi-Coloured Hamilton Cycles in Random Edge-Coloured Graphs". Combinatorics, Probability and Computing 11, n.º 2 (março de 2002): 129–33. http://dx.doi.org/10.1017/s0963548301005004.
Texto completo da fonteKOSTOCHKA, ALEXANDR, e MATTHEW YANCEY. "Large Rainbow Matchings in Edge-Coloured Graphs". Combinatorics, Probability and Computing 21, n.º 1-2 (2 de fevereiro de 2012): 255–63. http://dx.doi.org/10.1017/s0963548311000605.
Texto completo da fonteBENEVIDES, F. S., T. ŁUCZAK, A. SCOTT, J. SKOKAN e M. WHITE. "Monochromatic Cycles in 2-Coloured Graphs". Combinatorics, Probability and Computing 21, n.º 1-2 (março de 2012): 57–87. http://dx.doi.org/10.1017/s0963548312000090.
Texto completo da fonteDIAO, Y., e G. HETYEI. "Relative Tutte Polynomials of Tensor Products of Coloured Graphs". Combinatorics, Probability and Computing 22, n.º 6 (4 de setembro de 2013): 801–28. http://dx.doi.org/10.1017/s0963548313000370.
Texto completo da fonteKITTIPASSORN, TEERADEJ, e BHARGAV P. NARAYANAN. "A Canonical Ramsey Theorem for Exactly m-Coloured Complete Subgraphs". Combinatorics, Probability and Computing 23, n.º 1 (18 de outubro de 2013): 102–15. http://dx.doi.org/10.1017/s0963548313000503.
Texto completo da fonteBrewster, Richard C., Florent Foucaud, Pavol Hell e Reza Naserasr. "The complexity of signed graph and edge-coloured graph homomorphisms". Discrete Mathematics 340, n.º 2 (fevereiro de 2017): 223–35. http://dx.doi.org/10.1016/j.disc.2016.08.005.
Texto completo da fontePham Ngoc, Diep. "A new condition for a graph having conflict free connection number 2". Journal of Science Natural Science 66, n.º 1 (março de 2021): 25–29. http://dx.doi.org/10.18173/2354-1059.2021-0003.
Texto completo da fonteFujita, Shinya, Ruonan Li e Guanghui Wang. "Decomposing edge-coloured graphs under colour degree constraints". Combinatorics, Probability and Computing 28, n.º 5 (1 de março de 2019): 755–67. http://dx.doi.org/10.1017/s0963548319000014.
Texto completo da fontePiejko, Krzysztof, e Iwona Włoch. "Onk-Distance Pell Numbers in 3-Edge-Coloured Graphs". Journal of Applied Mathematics 2014 (2014): 1–6. http://dx.doi.org/10.1155/2014/428020.
Texto completo da fonteMARCINISZYN, MARTIN, RETO SPÖHEL e ANGELIKA STEGER. "Upper Bounds for Online Ramsey Games in Random Graphs". Combinatorics, Probability and Computing 18, n.º 1-2 (março de 2009): 259–70. http://dx.doi.org/10.1017/s0963548308009620.
Texto completo da fonteTeses / dissertações sobre o assunto "Edge-coloured graph"
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
White, M. D. "Cycles in edge-coloured graphs and subgraphs of random graphs". Thesis, University of Oxford, 2011. http://ora.ox.ac.uk/objects/uuid:95ef351e-acb1-442c-adf5-970487e30a4d.
Texto completo da fonteHenderson, Matthew James. "Embedding Symmetric Latin Squares and Edge-Coloured graphs". Thesis, University of Reading, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.485356.
Texto completo da fonteRafiey-Hafshejani, Arash. "Extremal and optimization problems on dense directed and edge-coloured graphs". Thesis, Royal Holloway, University of London, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.435465.
Texto completo da fonteCapítulos de livros sobre o assunto "Edge-coloured graph"
Beneš, Nikola, Luboš Brim, Samuel Pastva e David Šafránek. "Symbolic Coloured SCC Decomposition". In Tools and Algorithms for the Construction and Analysis of Systems, 64–83. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72013-1_4.
Texto completo da fonteBang-Jensen, Jørgen, e Gregory Z. Gutin. "Applications of Digraphs and Edge-Coloured Graphs". In Springer Monographs in Mathematics, 643–94. London: Springer London, 2009. http://dx.doi.org/10.1007/978-1-84800-998-1_17.
Texto completo da fonteTrabalhos de conferências sobre o assunto "Edge-coloured graph"
Zatesko, Leandro M., Renato Carmo e André L. P. Guedes. "Novel Procedures for Graph Edge-colouring". In XXXII Concurso de Teses e Dissertações da SBC. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/ctd.2019.6331.
Texto completo da fonte