Relevant bibliographies by topics / Properly colored subgraph

Academic literature on the topic 'Properly colored subgraph'

Author: Grafiati
Published: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Properly colored subgraph.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Properly colored subgraph"

1

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.

Full text
Abstract:
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, and other styles
2

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.

Full text
Abstract:
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, and other styles
3

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.

Full text
Abstract:
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, and other styles
4

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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.

Full text
Abstract:
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, and other styles
9

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Conference papers on the topic "Properly colored subgraph"

1

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.

Full text
Abstract:
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, and other styles
You might also be interested in the extended bibliographies on the topic 'Properly colored subgraph' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography