Gotowa bibliografia na temat „Properly coloured subgraph”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Properly coloured subgraph”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Properly coloured subgraph"
Axenovich, Maria, Tao Jiang i Z. Tuza. "Local Anti-Ramsey Numbers of Graphs". Combinatorics, Probability and Computing 12, nr 5-6 (listopad 2003): 495–511. http://dx.doi.org/10.1017/s0963548303005868.
Pełny tekst źródłaKOSTOCHKA, ALEXANDR, i MATTHEW YANCEY. "Large Rainbow Matchings in Edge-Coloured Graphs". Combinatorics, Probability and Computing 21, nr 1-2 (2.02.2012): 255–63. http://dx.doi.org/10.1017/s0963548311000605.
Pełny tekst źródłaMarkström, Klas, Andrew Thomason i Peter Wagner. "Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree". Graphs and Combinatorics 27, nr 2 (1.09.2010): 243–49. http://dx.doi.org/10.1007/s00373-010-0970-5.
Pełny tekst źródłaAlon, Noga, Alexey Pokrovskiy i Benny Sudakov. "Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles". Israel Journal of Mathematics 222, nr 1 (październik 2017): 317–31. http://dx.doi.org/10.1007/s11856-017-1592-x.
Pełny tekst źródłaJOUVE, FLORENT, i JEAN-SÉBASTIEN SERENI. "EXPANDER GRAPHS AND SIEVING IN COMBINATORIAL STRUCTURES". Journal of the Australian Mathematical Society 105, nr 1 (11.01.2018): 79–102. http://dx.doi.org/10.1017/s1446788717000234.
Pełny tekst źródłaClemens, Dennis, Anita Liebenau i Damian Reding. "On minimal Ramsey graphs and Ramsey equivalence in multiple colours". Combinatorics, Probability and Computing 29, nr 4 (9.03.2020): 537–54. http://dx.doi.org/10.1017/s0963548320000036.
Pełny tekst źródłaHaxell, P. E., Y. Kohayakawa i T. Łuczak. "The Induced Size-Ramsey Number of Cycles". Combinatorics, Probability and Computing 4, nr 3 (wrzesień 1995): 217–39. http://dx.doi.org/10.1017/s0963548300001619.
Pełny tekst źródłaJanssen, Jeannette, Rogers Mathew i Deepak Rajendraprasad. "Partial List Colouring of Certain Graphs". Electronic Journal of Combinatorics 22, nr 3 (20.09.2015). http://dx.doi.org/10.37236/4283.
Pełny tekst źródłaScott, Alex, i Paul Seymour. "Induced Subgraphs of Graphs with Large Chromatic Number IX: Rainbow Paths". Electronic Journal of Combinatorics 24, nr 2 (30.06.2017). http://dx.doi.org/10.37236/6768.
Pełny tekst źródłaCaro, Yair, Adriana Hansberg, Josef Lauri i Christina Zarb. "On Zero-Sum Spanning Trees and Zero-Sum Connectivity". Electronic Journal of Combinatorics 29, nr 1 (28.01.2022). http://dx.doi.org/10.37236/10289.
Pełny tekst źródłaRozprawy doktorskie na temat "Properly coloured subgraph"
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.
Pełny tekst źródłaGraph 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