Thematische Bibliographien / Properly colored subgraph

Inhaltsverzeichnis

  1. Zeitschriftenartikel
  2. Konferenzberichte

Auswahl der wissenschaftlichen Literatur zum Thema „Properly colored subgraph“

Autor: Grafiati
Veröffentlicht am 25. Mai 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Properly colored subgraph" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Properly colored subgraph"

1

M, Jerlin Seles, und 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.

Der volle Inhalt der Quelle
Annotation:
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 und andere Zitierweisen
2

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

Der volle Inhalt der Quelle
Annotation:
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 und andere Zitierweisen
3

KOSTOCHKA, ALEXANDR, und MATTHEW YANCEY. „Large Rainbow Matchings in Edge-Coloured Graphs“. Combinatorics, Probability and Computing 21, Nr. 1-2 (02.02.2012): 255–63. http://dx.doi.org/10.1017/s0963548311000605.

Der volle Inhalt der Quelle
Annotation:
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 und andere Zitierweisen
4

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Katić, Robert, Colton Magnant und 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.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Alon, Noga, Tao Jiang, Zevi Miller und 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.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Jaradat, M. M. M., M. S. A. Bataineh und 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.

Der volle Inhalt der Quelle
Annotation:
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 und andere Zitierweisen
9

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Konferenzberichte zum Thema "Properly colored subgraph"

1

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

Der volle Inhalt der Quelle
Annotation:
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 und andere Zitierweisen
Die Auswahlen zum Thema "Properly colored subgraph" für konkrete Quellenarten können Sie auch interessieren:
Zeitschriftenartikel
Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!

Zur Bibliographie