Imagen de Portada

On Modular Edge Colourings of Graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Berthe, Gaétan, Bonamy, Marthe, Botler, Fábio, Carenini, Gaia, Colucci, Lucas, Dumas, Arthur, Ghasemi, Fatemeh, Neto, Pedro Mariano Viana
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

$χ$-Boundedness and Neighbourhood Complexity of Bounded Merge-Width Graphs
por: Bonamy, Marthe, et al.
Publicado: (2025)

On the Modular Chromatic Index of Random Hypergraphs
por: Carenini, Gaia, et al.
Publicado: (2025)

Bipartite Turán number of paths and other trees
por: Bonamy, Marthe, et al.
Publicado: (2025)

On graph classes with constant domination-packing ratio
por: Bonamy, Marthe, et al.
Publicado: (2025)

On cuts of small chromatic number in sparse graphs
por: Aubian, Guillaume, et al.
Publicado: (2025)

A Gray code for arborescences of tournaments
por: Bonamy, Marthe, et al.
Publicado: (2026)

On a recolouring version of Hadwiger's conjecture
por: Bonamy, Marthe, et al.
Publicado: (2021)

Separating the edges of a graph by cycles and by subdivisions of $K_4$
por: Botler, Fábio, et al.
Publicado: (2024)

Ramsey Goodness of paths and unbalanced graphs
por: Botler, Fábio, et al.
Publicado: (2024)

Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
por: Bonamy, Marthe, et al.
Publicado: (2020)

Determining a graph from its reconfiguration graph
por: Berthe, Gaétan, et al.
Publicado: (2025)

3-Colouring Planar Graphs
por: Dujmović, Vida, et al.
Publicado: (2025)

Biclique immersions in graphs with independence number 2
por: Botler, Fábio, et al.
Publicado: (2023)

Weakly-sparse and strongly flip-flat classes of graphs are uniformly almost-wide
por: Ghasemi, Fatemeh, et al.
Publicado: (2025)

On Alternating 6-Cycles in Edge-Coloured Graphs
por: Chen, Hao, et al.
Publicado: (2025)

Flips and Merge-Width in Sparse Graphs
por: Drabik, Karolina, et al.
Publicado: (2026)

Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs
por: Botler, F., et al.
Publicado: (2024)

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
por: Botler, Fábio, et al.
Publicado: (2025)

Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs
por: Bok, Jan, et al.
Publicado: (2020)

Characterization of Word-Representable Graphs using Modular Decomposition
por: Dwary, Tithi, et al.
Publicado: (2024)

Colouring t-perfect graphs
por: Chudnovsky, Maria, et al.
Publicado: (2024)

The Dominating 4-Colour Theorem
por: Girão, António, et al.
Publicado: (2026)

Graphs With the Same Edge Count in Each Neighborhood
por: Sheffield, Nathan S., et al.
Publicado: (2025)

A Simplified Proof for the Edge-Density of 4-Planar Graphs
por: Büngener, Aaron
Publicado: (2025)

Transducing Linear Decompositions of Tournaments
por: Geniet, Colin, et al.
Publicado: (2026)

Colouring Probe $H$-Free Graphs
por: Paulusma, Daniël, et al.
Publicado: (2025)

Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces
por: Bonamy, Marthe, et al.
Publicado: (2020)

On the $E$-base of Finite Lattices: Semidistributive, Modular, and Geometric Lattices
por: Adaricheva, Kira, et al.
Publicado: (2025)

Isomorphisms of unit distance graphs of layers
por: Bikeev, Arthur Igorevich
Publicado: (2025)

Edge open packing: further characterizations
por: Pandey, Arti, et al.
Publicado: (2025)

Graph Irregularity via Edge Deletions
por: Bensmail, Julien, et al.
Publicado: (2025)

Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors
por: Bonamy, Marthe, et al.
Publicado: (2025)

Network Representation and Modular Decomposition of Combinatorial Structures: A Galled-Tree Perspective
por: Lindeberg, Anna, et al.
Publicado: (2024)

Edge open packing on subclasses of chordal graphs
por: Santra, Kamal
Publicado: (2025)

Edge densities of drawings of graphs with one forbidden cell
por: Hahn, Benedikt, et al.
Publicado: (2025)

Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-graphs
por: Lozin, Vadim, et al.
Publicado: (2022)

Optimal b-Colourings and Fall Colourings in $H$-Free Graphs
por: Ahn, Jungho, et al.
Publicado: (2026)

Characterization of Circular-arc Graphs: III. Chordal Graphs
por: Cao, Yixin, et al.
Publicado: (2024)

Graph Theory
por: Gilbert, Jesse D.
Publicado: (2011)

A Characterization of Geodetic Graphs in Terms of their Embedded Even Graphs
por: Frasser, Carlos E.
Publicado: (2026)