Готові списки джерел за темами / Properly colored subgraph

Зміст

Статті в журналах
Тези доповідей конференцій

Добірка наукової літератури з теми "Properly colored subgraph"

Автор: Grafiati

Опубліковано: 25 травня 2024

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Properly colored subgraph".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Properly colored subgraph"

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

Повний текст джерела

Анотація:

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.

Стилі APA, Harvard, Vancouver, ISO та ін.

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

Повний текст джерела

Анотація:

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.

Стилі APA, Harvard, Vancouver, ISO та ін.

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

Повний текст джерела

Анотація:

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.

Стилі APA, Harvard, Vancouver, ISO та ін.

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

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

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

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

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

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

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

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

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

Повний текст джерела

Анотація:

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.

Стилі APA, Harvard, Vancouver, ISO та ін.

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

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

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

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Тези доповідей конференцій з теми "Properly colored subgraph"

Andrade, Davi de, and 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.

Повний текст джерела

Анотація:

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.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!