Tiling Edge-Coloured Graphs with Few Monochromatic Bounded-Degree Graphs

Jan Corsten; Walner Mendonça

doi:10.1007/s00493-023-00072-1

ScienceGate Book Chapters

JOURNAL ARTICLE

Tiling Edge-Coloured Graphs with Few Monochromatic Bounded-Degree Graphs

Jan Corsten Walner Mendonça

Year: 2023 Journal: COMBINATORICA Vol: 44 (2)Pages: 311-335 Publisher: Springer Science+Business Media

DOI: 10.1007/s00493-023-00072-1

Get Full-Text PDF Get Analytical Report

Keywords:

Combinatorics Monochromatic color Mathematics Partition (number theory) Conjecture Bounded function Vertex (graph theory) Degree (music) Discrete mathematics Graph Physics Mathematical analysis

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.01

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Limits and Structures in Graph Theory

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

Advanced Topology and Set Theory

Physical Sciences → Mathematics → Geometry and Topology

Tiling Edge-Coloured Graphs with Few Monochromatic Bounded-Degree Graphs

Metrics

Topics

Related Documents

Tiling edge-coloured graphs with few monochromatic bounded-degree graphs

Tiling with monochromatic bipartite graphs of bounded maximum degree

Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree

Partitioning edge-coloured complete graphs into monochromatic cycles

Monochromatic Partitions in 2-Edge-Coloured Bipartite Graphs