Cover Image

4-tangrams are 4-avoidable

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ochem, Pascal, Pierron, Théo
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Contact graphs of boxes with unidirectional contacts
by: Gonçalves, Daniel, et al.
Published: (2023)

Critical exponent of binary words with few distinct palindromes
by: Dvořáková, L'ubomíra, et al.
Published: (2023)

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

Chromatic discrepancy of locally $s$-colourable graphs
by: Corsini, Timothée, et al.
Published: (2025)

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

Pseudoperiodic Words and a Question of Shevelev
by: Meleshko, Joseph, et al.
Published: (2022)

Emerging consecutive pattern avoidance
by: Hassler, Nathanaël, et al.
Published: (2025)

A note on highly connected $K_{2,\ell}$-minor free graphs
by: Bousquet, Nicolas, et al.
Published: (2023)

Antisquares and Critical Exponents
by: Baranwal, Aseem, et al.
Published: (2022)

Fast winning strategies for the attacker in eternal domination
by: Bagan, Guillaume, et al.
Published: (2024)

The tape reconfiguration problem and its consequences for dominating set reconfiguration
by: Bousquet, Nicolas, et al.
Published: (2025)

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

($P_2+P_4$, $K_4-e$)-free graphs are nearly $ω$-colorable
by: Angeliya, C. U., et al.
Published: (2025)

Forcing quasirandomness with 4-point permutations
by: Kráľ, Daniel, et al.
Published: (2024)

Size-4 Counterexamples to the Sidon-Extension Conjecture
by: Niu, Tong
Published: (2026)

On graphs with a simple structure of maximal cliques
by: Gollin, J. Pascal, et al.
Published: (2025)

Extending Robinson Spaces: Complexity and Algorithmic Solutions for Non-Symmetric Dissimilarity Spaces
by: Brucker, Francois, et al.
Published: (2024)

Pushing Cops and Robber on Graphs of Maximum Degree 4
by: Gahlawat, Harmender
Published: (2025)

Winding number and circular 4-coloring of signed graphs
by: Gujgiczer, Anna, et al.
Published: (2023)

The Graph Coloring Game on $4\times n$-Grids
by: Brosse, Caroline, et al.
Published: (2024)

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

Word-Representability of Split Graphs with Independent Set of Size 4
by: Roy, Suchanda, et al.
Published: (2025)

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

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

Generalized Three and Four Person Hat Game
by: van Uem, Theo
Published: (2017)

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

Tree-independence number of $P_5$-free graphs with no large bicliques
by: Blažej, Václav, et al.
Published: (2026)

Maker-Maker games of rank 4 are PSPACE-complete
by: Galliot, Florian, et al.
Published: (2025)

4-uniform Maker-Breaker and Maker-Maker games are PSPACE-complete
by: Galliot, Florian
Published: (2025)

Inversion diameter and 2-edge-colored homomorphisms
by: Arana, Carmen, et al.
Published: (2026)

An Upper Bound on the Weisfeiler-Leman Dimension
by: Schneider, Thomas, et al.
Published: (2024)

The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem
by: Esperet, Louis, et al.
Published: (2023)

Boundedness and Separation in the Graph Covering Number Framework
by: Goetze, Miriam, et al.
Published: (2025)

A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number
by: Bourneuf, Romain, et al.
Published: (2025)

Induced Minors and Region Intersection Graphs
by: Bonnet, Édouard, et al.
Published: (2025)

Self-Orthogonal Cellular Automata
by: Mariot, Luca, et al.
Published: (2025)

Progress on Self Identifying Codes
by: Jean, Devin, et al.
Published: (2025)

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

Accelerated Cops and Robbers
by: Kinnersley, William B., et al.
Published: (2025)

Faces in rectilinear drawings of complete graphs
by: Balko, Martin, et al.
Published: (2025)