Contact graphs of boxes with unidirectional contacts
Fuente:
arXiv
Saved in:
| Main Authors: | Gonçalves, Daniel, Limouzy, Vincent, Ochem, Pascal |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
4-tangrams are 4-avoidable
by: Ochem, Pascal, et al.
Published: (2025)
by: Ochem, Pascal, et al.
Published: (2025)
Critical exponent of binary words with few distinct palindromes
by: Dvořáková, L'ubomíra, et al.
Published: (2023)
by: Dvořáková, L'ubomíra, et al.
Published: (2023)
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
by: Beaudou, Laurent, et al.
Published: (2021)
by: Beaudou, Laurent, et al.
Published: (2021)
Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs
by: Bok, Jan, et al.
Published: (2020)
by: Bok, Jan, et al.
Published: (2020)
3-colorable planar graphs have an intersection segment representation using 3 slopes
by: Gonçalves, Daniel
Published: (2025)
by: Gonçalves, Daniel
Published: (2025)
Pseudoperiodic Words and a Question of Shevelev
by: Meleshko, Joseph, et al.
Published: (2022)
by: Meleshko, Joseph, et al.
Published: (2022)
On graphs with a simple structure of maximal cliques
by: Gollin, J. Pascal, et al.
Published: (2025)
by: Gollin, J. Pascal, et al.
Published: (2025)
Antisquares and Critical Exponents
by: Baranwal, Aseem, et al.
Published: (2022)
by: Baranwal, Aseem, et al.
Published: (2022)
On the expansion of Hanoi graphs
by: Eppstein, David, et al.
Published: (2025)
by: Eppstein, David, et al.
Published: (2025)
Twin-width of graphs on surfaces
by: Kráľ, Daniel, et al.
Published: (2023)
by: Kráľ, Daniel, et al.
Published: (2023)
Tree-independence number of $P_5$-free graphs with no large bicliques
by: Blažej, Václav, et al.
Published: (2026)
by: Blažej, Václav, et al.
Published: (2026)
Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
by: Beaudou, Laurent, et al.
Published: (2025)
by: Beaudou, Laurent, et al.
Published: (2025)
The treewidth and pathwidth of graph unions
by: Alecu, Bogdan, et al.
Published: (2022)
by: Alecu, Bogdan, et al.
Published: (2022)
Playing Sudoku on random 3-regular graphs
by: Dippel, Jack, et al.
Published: (2025)
by: Dippel, Jack, et al.
Published: (2025)
Biclique immersions in graphs with independence number 2
by: Botler, Fábio, et al.
Published: (2023)
by: Botler, Fábio, et al.
Published: (2023)
Hamiltonicity of Schrijver graphs and stable Kneser graphs
by: Mütze, Torsten, et al.
Published: (2024)
by: Mütze, Torsten, et al.
Published: (2024)
On universal graphs for trees and treewidth $k$ graphs
by: Kaul, Neel, et al.
Published: (2025)
by: Kaul, Neel, et al.
Published: (2025)
Determining a graph from its reconfiguration graph
by: Berthe, Gaétan, et al.
Published: (2025)
by: Berthe, Gaétan, et al.
Published: (2025)
Vertex-critical graphs in co-gem-free graphs
by: Beaton, Iain, et al.
Published: (2024)
by: Beaton, Iain, et al.
Published: (2024)
Effects of graph operations on star pairwise compatibility graphs
by: Monti, Angelo, et al.
Published: (2024)
by: Monti, Angelo, et al.
Published: (2024)
Long induced paths in sparse graphs and graphs with forbidden patterns
by: Duron, Julien, et al.
Published: (2024)
by: Duron, Julien, et al.
Published: (2024)
Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
by: Foucaud, Florent, et al.
Published: (2024)
by: Foucaud, Florent, et al.
Published: (2024)
Hitting all longest paths in $H$-free graphs and $H$-graphs
by: de Lima, Paloma T., et al.
Published: (2025)
by: de Lima, Paloma T., et al.
Published: (2025)
Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-graphs
by: Lozin, Vadim, et al.
Published: (2022)
by: Lozin, Vadim, et al.
Published: (2022)
EPPA numbers of graphs
by: Bradley-Williams, David, et al.
Published: (2023)
by: Bradley-Williams, David, et al.
Published: (2023)
Diameter of the inversion graph
by: Havet, Frédéric, et al.
Published: (2024)
by: Havet, Frédéric, et al.
Published: (2024)
Colouring t-perfect graphs
by: Chudnovsky, Maria, et al.
Published: (2024)
by: Chudnovsky, Maria, et al.
Published: (2024)
Contractions in perfect graph
by: Dupont-Bouillard, Alexandre, et al.
Published: (2024)
by: Dupont-Bouillard, Alexandre, et al.
Published: (2024)
On total transitivity of graphs
by: Santra, Kamal
Published: (2025)
by: Santra, Kamal
Published: (2025)
Linear colorings of graphs
by: Hilaire, Claire, et al.
Published: (2025)
by: Hilaire, Claire, et al.
Published: (2025)
Path eccentricity of $k$-AT-free graphs and application on graphs with the consecutive ones property
by: Bastide, Paul, et al.
Published: (2024)
by: Bastide, Paul, et al.
Published: (2024)
Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations
by: Chakraborty, Dibyayan, et al.
Published: (2025)
by: Chakraborty, Dibyayan, et al.
Published: (2025)
Reliability evaluation of Cayley graph generated by unicyclic graphs based on cyclic fault pattern
by: Tian, Ting, et al.
Published: (2025)
by: Tian, Ting, et al.
Published: (2025)
Cop numbers of periodic graphs
by: De Carufel, Jean-Lou, et al.
Published: (2023)
by: De Carufel, Jean-Lou, et al.
Published: (2023)
Dichromatic number of chordal graphs
by: Bessy, Stéphane, et al.
Published: (2023)
by: Bessy, Stéphane, et al.
Published: (2023)
Neighborhood complexity of planar graphs
by: Joret, Gwenaël, et al.
Published: (2023)
by: Joret, Gwenaël, et al.
Published: (2023)
Acyclic colourings of graphs with obstructions
by: Chuet, Quentin, et al.
Published: (2022)
by: Chuet, Quentin, et al.
Published: (2022)
On approximating the rank of graph divisors
by: Bérczi, Kristóf, et al.
Published: (2022)
by: Bérczi, Kristóf, et al.
Published: (2022)
Equitable coloring of sparse graphs
by: Liu, Weichan, et al.
Published: (2024)
by: Liu, Weichan, et al.
Published: (2024)
On the inversion number of oriented graphs
by: Bang-Jensen, Jørgen, et al.
Published: (2021)
by: Bang-Jensen, Jørgen, et al.
Published: (2021)
Similar Items
-
4-tangrams are 4-avoidable
by: Ochem, Pascal, et al.
Published: (2025) -
Critical exponent of binary words with few distinct palindromes
by: Dvořáková, L'ubomíra, et al.
Published: (2023) -
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
by: Beaudou, Laurent, et al.
Published: (2021) -
Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs
by: Bok, Jan, et al.
Published: (2020) -
3-colorable planar graphs have an intersection segment representation using 3 slopes
by: Gonçalves, Daniel
Published: (2025)