Cover Image

Colourful components in $k$-caterpillars and planar graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chlebíková, Janka, Dallard, Clément
Format:	Preprint
Published:	2019
Subjects:	Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Graphs without a partition into two proportionally dense subgraphs
by: Bazgan, Cristina, et al.
Published: (2018)

Neighborhood complexity of planar graphs
by: Joret, Gwenaël, et al.
Published: (2023)

On constrained intersection representations of graphs and digraphs
by: Cicalese, Ferdinando, et al.
Published: (2025)

Colouring t-perfect graphs
by: Chudnovsky, Maria, et al.
Published: (2024)

Well-quasi-orders on embedded planar graphs
by: Lunel, Corentin, et al.
Published: (2025)

Expansion of gap-planar graphs
by: Wood, David R.
Published: (2025)

On minimally tough chordal graphs
by: Dallard, Clément, et al.
Published: (2022)

On $k$-planar Graphs without Short Cycles
by: Bekos, Michael A., et al.
Published: (2024)

Spanning caterpillar in biconvex bipartite graphs
by: Antony, Dhanyamol, et al.
Published: (2023)

Proper conflict-free choosability of planar graphs
by: Wang, Yuting, et al.
Published: (2025)

Elimination distance to bounded degree on planar graphs
by: Lindermayr, Alexander, et al.
Published: (2020)

Functionality of box intersection graphs
by: Dallard, Clément, et al.
Published: (2023)

On universal graphs for trees and treewidth $k$ graphs
by: Kaul, Neel, et al.
Published: (2025)

Induced Minor Models. II. Sufficient conditions for polynomial-time detection of induced minors
by: Dallard, Clément, et al.
Published: (2024)

Diameter of the inversion graph
by: Havet, Frédéric, et al.
Published: (2024)

2-distance 4-coloring of planar subcubic graphs with girth at least 21
by: La, Hoang, et al.
Published: (2021)

On the $(\leq p)$-inversion diameter of oriented graphs
by: Havet, Frédéric, et al.
Published: (2026)

Faster algorithms for graph homomorphism via tractable constraint satisfaction
by: Carbonnel, Clément
Published: (2026)

Path eccentricity of $k$-AT-free graphs and application on graphs with the consecutive ones property
by: Bastide, Paul, et al.
Published: (2024)

Largest planar graphs of diameter $3$ and fixed maximum degree -- connection with fractional matchings
by: Dailly, Antoine, et al.
Published: (2025)

3-colorable planar graphs have an intersection segment representation using 3 slopes
by: Gonçalves, Daniel
Published: (2025)

On the minimum number of inversions to make a digraph $k$-(arc-)strong
by: Duron, Julien, et al.
Published: (2023)

On the minimum number of arcs in $4$-dicritical oriented graphs
by: Havet, Frédéric, et al.
Published: (2023)

A Brooks-type theorem for the k-choosability of graphs with maximum local edge-connectivity k
by: Bastida, Sam, et al.
Published: (2026)

Centered colorings in minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2024)

Trees and co-trees in planar 3-connected graphs An easier proof via Schnyder woods
by: Ortlieb, Christian, et al.
Published: (2024)

Weak coloring numbers of minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2024)

Sample compression schemes for balls in structurally sparse graphs
by: Bourneuf, Romain, et al.
Published: (2026)

Blow-up structure of graphs excluding a tree or an apex-tree as a minor
by: Claus, Quentin, et al.
Published: (2026)

Centered colorings and weak coloring numbers in minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2026)

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

On Modular Edge Colourings of Graphs
by: Berthe, Gaétan, et al.
Published: (2025)

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

Colourings of $(m, n)$-coloured mixed graphs
by: MacGillivray, Gary, et al.
Published: (2020)

A polynomial bound on the pathwidth of graphs edge-coverable by $k$ shortest paths
by: Baste, Julien, et al.
Published: (2025)

Cops and robber in graphs with bounded vertex cover number
by: Bose, Prosenjit, et al.
Published: (2026)

Fast solutions to k-parity and k-synchronisation using parallel automata networks
by: Perrotin, Pacôme, et al.
Published: (2024)

Large planar $(n,m)$-cliques
by: Bandopadhyay, Susobhan, et al.
Published: (2024)

On the finiteness of $k$-vertex-critical $2P_2$-free graphs with forbidden induced squids or bulls
by: Adekanye, Melvin, et al.
Published: (2024)

3D-grids are not transducible from planar graphs
by: Gajarský, Jakub, et al.
Published: (2025)