Gotowe bibliografie tematyczne / Properly colored subgraph

Gotowa bibliografia na temat „Properly colored subgraph”

Autor: Grafiati

Data publikacji: 25 maja 2024

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Spis treści

Artykuły w czasopismach
Streszczenia konferencji

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Properly colored 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 colored subgraph"

M, Jerlin Seles, i Dr U. Mary. "Strategy on Disaster Recovery Management based on Graph Theory Concepts". International Journal of Recent Technology and Engineering (IJRTE) 10, nr 4 (30.11.2021): 31–34. http://dx.doi.org/10.35940/ijrte.d6535.1110421.

Pełny tekst źródła

Streszczenie:

The COVID-19 pandemic has asserted major baseline facts from disaster anthropology during the last three decades. Resilience could be based on the solution to the question: "What is the maximum amount of destruction, if any, that the graph (a network) can sustain while ensuring that at least one of each technology type remains and that the remaining induced subgraph is properly colored?" The concept of a graph's Chromatic Core Subgraph is a solution to the stated problem. In this paper, the pandemic graphs and certain sequential graphs are developed. For these graphs, the Chromatic core subgraph is obtained. The results of the pandemic graphs' Chromatic core subgraph are used to develop a disaster recovery strategy for the COVID-19 pandemic.

Style APA, Harvard, Vancouver, ISO itp.

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ła

Streszczenie:

A subgraph H in an edge-colouring is properly coloured if incident edges of H are assigned different colours, and H is rainbow if no two edges of H are assigned the same colour. We study properly coloured subgraphs and rainbow subgraphs forced in edge-colourings of complete graphs in which each vertex is incident to a large number of colours.

Style APA, Harvard, Vancouver, ISO itp.

KOSTOCHKA, 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ła

Streszczenie:

Arainbow subgraphof an edge-coloured graph is a subgraph whose edges have distinct colours. Thecolour degreeof a vertexvis the number of different colours on edges incident withv. Wang and Li conjectured that fork≥ 4, every edge-coloured graph with minimum colour degreekcontains a rainbow matching of size at least ⌈k/2⌉. A properly edge-colouredK4has no such matching, which motivates the restrictionk≥ 4, but Li and Xu proved the conjecture for all other properly coloured complete graphs. LeSaulnier, Stocker, Wenger and West showed that a rainbow matching of size ⌊k/2⌋ is guaranteed to exist, and they proved several sufficient conditions for a matching of size ⌈k/2⌉. We prove the conjecture in full.

Style APA, Harvard, Vancouver, ISO itp.

Manoussakis, Y., M. Spyratos, Zs Tuza i M. Voigt. "Minimal colorings for properly colored subgraphs". Graphs and Combinatorics 12, nr 4 (grudzień 1996): 345–60. http://dx.doi.org/10.1007/bf01858468.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Rödl, Vojtech, i Zsolt Tuza. "Rainbow subgraphs in properly edge-colored graphs". Random Structures & Algorithms 3, nr 2 (1992): 175–82. http://dx.doi.org/10.1002/rsa.3240030207.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Katić, Robert, Colton Magnant i Pouria Salehi Nowbandegani. "Forbidden Properly Edge-Colored Subgraphs that Force Large Highly Connected Monochromatic Subgraphs". Graphs and Combinatorics 33, nr 4 (26.05.2017): 969–79. http://dx.doi.org/10.1007/s00373-017-1804-5.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Alon, Noga, Tao Jiang, Zevi Miller i Dan Pritikin. "Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints". Random Structures and Algorithms 23, nr 4 (11.11.2003): 409–33. http://dx.doi.org/10.1002/rsa.10102.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Jaradat, M. M. M., M. S. A. Bataineh i S. M. E. Radaideh. "Ramsey Numbers for Theta Graphs". International Journal of Combinatorics 2011 (15.06.2011): 1–9. http://dx.doi.org/10.1155/2011/649687.

Pełny tekst źródła

Streszczenie:

The graph Ramsey number is the smallest integer with the property that any complete graph of at least vertices whose edges are colored with two colors (say, red and blue) contains either a subgraph isomorphic to all of whose edges are red or a subgraph isomorphic to all of whose edges are blue. In this paper, we consider the Ramsey numbers for theta graphs. We determine , for . More specifically, we establish that for . Furthermore, we determine for . In fact, we establish that if is even, if is odd.

Style APA, Harvard, Vancouver, ISO itp.

Markströ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ła

Style APA, Harvard, Vancouver, ISO itp.

Magnant, Colton, Daniel M. Martin i Pouria Salehi Nowbandegani. "Monochromatic Subgraphs in the Absence of a Properly Colored 4-Cycle". Graphs and Combinatorics 34, nr 6 (8.10.2018): 1147–58. http://dx.doi.org/10.1007/s00373-018-1955-z.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Streszczenia konferencji na temat "Properly colored subgraph"

Andrade, Davi de, i Ana Silva. "(Sub)Fall Coloring and B-Coloring Parameterized by Treewidth". W Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2022. http://dx.doi.org/10.5753/etc.2022.222982.

Pełny tekst źródła

Streszczenie:

Given a proper coloring f of G, a vertex u is a b-vertex if it is adjacent to every color class distinct from its own. It is said to be a b-coloring if each color class contains at least one b-vertex, and a fall coloring if all vertices are b-vertices. Also, if f is a fall coloring of an induced subgraph H of G, then we say that f is a subfall coloring of G. In this paper, we provide algorithms for each of the decision problems related to these colorings whose running times are FPT when parameterized by the number of colors plus the treewidth of the input graph.

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!