Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey (Q1014813): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-008-0789-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2026043319 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q105583341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicolored trees in complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lengths of rainbow cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicolored forests in bipartite decompositions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4358434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Anti-Ramsey Numbers of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear k-arboricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5466081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with many or few colors in edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4659605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicolored trees in complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicolored forests in complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum labeling spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heterochromatic tree partition numbers for complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long heterochromatic paths in edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color neighborhood union conditions for long heterochromatic paths in edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4836076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorful isomorphic spanning trees in complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold / rank
 
Normal rank
Property / cites work
 
Property / cites work: Latin squares. New developments in the theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of a rainbow 1‐factor in 1‐factorizations of <i>K</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monochromatic infinite paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal paths and circuits of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex coverings by monochromatic cycles and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polychromatic Hamilton cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum degree and fractional matchings in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings and covers in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex coverings by monochromatic paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3977492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4211749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved bound for the monochromatic cycle partition number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge colorings of complete graphs without tricolored triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path and cycle sub-Ramsey numbers and an edge-colouring conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3474665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning by monochromatic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning complete bipartite graphs by monochromatic cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-colorings of complete graphs that avoid polychromatic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity for partitioning graphs by monochromatic trees, cycles and paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex partitions of \(r\)-edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning complete multipartite graphs by monochromatic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of the Gallai-Roy theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3011793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3620556 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum monochromatic or multicolored subgraph partition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4865523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An anti-Ramsey Theorem on edge-cutsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense graphs without 3-regular subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monochromatic Paths in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow subgraphs in properly edge‐colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex partitions by connected monochromatic \(k\)-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversals of latin squares and their generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow \(H\)-factors / rank
 
Normal rank

Latest revision as of 12:12, 1 July 2024

scientific article
Language Label Description Also known as
English
Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
scientific article

    Statements

    Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey (English)
    0 references
    0 references
    0 references
    29 April 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers