Bibliografias temáticas / Properly colored subgraph

Literatura científica selecionada sobre o tema "Properly colored subgraph"

Autor: Grafiati

Publicado: 25 de maio de 2024

Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos

Selecione um tipo de fonte:

Índice

Artigos de revistas
Trabalhos de conferências

Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Properly colored subgraph".

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 "Properly colored subgraph"

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

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Axenovich, Maria, Tao Jiang e Z. Tuza. "Local Anti-Ramsey Numbers of Graphs". Combinatorics, Probability and Computing 12, n.º 5-6 (novembro de 2003): 495–511. http://dx.doi.org/10.1017/s0963548303005868.

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

KOSTOCHKA, 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 fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Manoussakis, Y., M. Spyratos, Zs Tuza e M. Voigt. "Minimal colorings for properly colored subgraphs". Graphs and Combinatorics 12, n.º 4 (dezembro de 1996): 345–60. http://dx.doi.org/10.1007/bf01858468.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Markström, Klas, Andrew Thomason e Peter Wagner. "Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree". Graphs and Combinatorics 27, n.º 2 (1 de setembro de 2010): 243–49. http://dx.doi.org/10.1007/s00373-010-0970-5.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Mais fontes

Trabalhos de conferências sobre o assunto "Properly colored subgraph"

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

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Oferecemos descontos em todos os planos premium para autores cujas obras estão incluídas em seleções literárias temáticas. Contate-nos para obter um código promocional único!