Bibliografías temáticas / Properly colored subgraph

Literatura académica sobre el tema "Properly colored subgraph"

Autor: Grafiati

Publicado: 25 de mayo de 2024

Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros

Elija tipo de fuente:

Índice

Artículos de revistas
Actas de conferencias

Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Properly colored subgraph".

Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.

También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.

Artículos de revistas sobre el tema "Properly colored subgraph"

M, Jerlin Seles y 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 noviembre de 2021): 31–34. http://dx.doi.org/10.35940/ijrte.d6535.1110421.

Texto completo

Resumen

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.

Los estilos APA, Harvard, Vancouver, ISO, etc.

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

Texto completo

Resumen

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.

Los estilos APA, Harvard, Vancouver, ISO, etc.

KOSTOCHKA, ALEXANDR y MATTHEW YANCEY. "Large Rainbow Matchings in Edge-Coloured Graphs". Combinatorics, Probability and Computing 21, n.º 1-2 (2 de febrero de 2012): 255–63. http://dx.doi.org/10.1017/s0963548311000605.

Texto completo

Resumen

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.

Los estilos APA, Harvard, Vancouver, ISO, etc.

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Rödl, Vojtech y 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

Los estilos APA, Harvard, Vancouver, ISO, etc.

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

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

Texto completo

Resumen

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.

Los estilos APA, Harvard, Vancouver, ISO, etc.

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Más fuentes

Actas de conferencias sobre el tema "Properly colored subgraph"

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

Texto completo

Resumen

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.

Los estilos APA, Harvard, Vancouver, ISO, etc.

Ofrecemos descuentos en todos los planes premium para autores cuyas obras están incluidas en selecciones literarias temáticas. ¡Contáctenos para obtener un código promocional único!