Image de couverture de livre

On the range of two-distance graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Ágoston, Péter
Format:	Preprint
Publié:	2026
Sujets:	Combinatorics 05C10
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A lower bound on the number of colours needed to nicely colour a sphere
par: Ágoston, Péter
Publié: (2024)

Ordered Yao graphs: maximum degree, edge numbers, and clique numbers
par: Ágoston, Péter, et autres
Publié: (2025)

1-planar unit distance graphs
par: Gehér, Panna, et autres
Publié: (2023)

Colouring negative exact-distance graphs of signed graphs
par: Naserasr, Reza, et autres
Publié: (2024)

The matching book embedding of the $F$-sum of two graphs
par: Shao, Zeling, et autres
Publié: (2026)

Maximizing the Maximum Degree in Ordered Nearest Neighbor Graphs
par: Ágoston, Péter, et autres
Publié: (2024)

Difference of facial achromatic numbers between two triangular embeddings of a graph
par: Enami, Kengo, et autres
Publié: (2021)

The resistance distance of a dual number weighted graph
par: Li, Yu, et autres
Publié: (2025)

Reconstructing a graph from the distance matrix of its boundary
par: Cáceres, José, et autres
Publié: (2024)

The Möbius-Kantor graph is a faithful unit-distance graph
par: Bašić, Nino, et autres
Publié: (2025)

An improved bound for 2-distance coloring of planar graphs with girth six
par: Deniz, Zakir
Publié: (2022)

Quadratic form estimations for Hessian matrices of resistance distance and Kirchhoff index of positive-weighted graphs
par: Li, Yu, et autres
Publié: (2026)

The point-thicknesses of complete multipartite graphs
par: Liu, Wenzhong, et autres
Publié: (2026)

Partial-dual genus polynomial of graphs
par: Cheng, Zhiyun
Publié: (2025)

Polynomial invariants of cyclically ordered graphs
par: Bratch, Paul, et autres
Publié: (2025)

Packing independent cliques into planar graphs
par: Biró, Csaba, et autres
Publié: (2024)

On the dispersability of graph bundles over cycles
par: Shao, Zeling, et autres
Publié: (2024)

Subgraph-universal planar graphs for trees
par: Bergold, Helena, et autres
Publié: (2024)

Enumerating typical abelian coverings of Cayley graphs
par: Chen, Haimiao
Publié: (2012)

Spanning plane subgraphs of $1$-plane graphs
par: Noguchi, Kenta, et autres
Publié: (2024)

The total chord length of maximal outerplanar graphs
par: Broadus, Haley, et autres
Publié: (2024)

On $(r,c)$-constant, planar and circulant graphs
par: Caro, Yair, et autres
Publié: (2024)

A Fano framework for embeddings of graphs in surfaces
par: Dunshee, Blake, et autres
Publié: (2024)

Decomposition of toroidal graphs without some subgraphs
par: Wang, Tao, et autres
Publié: (2025)

Lifting automorphisms along abelian regular coverings of graphs
par: Chen, Haimiao
Publié: (2011)

Proper conflict-free degree-choosability of outerplanar graphs
par: Kashima, Masaki, et autres
Publié: (2025)

On the maximum partial-dual genus of a planar graph
par: Chen, Jiaying, et autres
Publié: (2025)

Determining the minimum size of maximal 1-plane graphs
par: Huang, Yuanqiu, et autres
Publié: (2025)

The minimum size of maximal bipartite IC-plane graphs with given connectivity
par: Wang, Guiping, et autres
Publié: (2025)

Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph
par: Borradaile, Glencora, et autres
Publié: (2017)

Excluding sums of Kuratowski graphs
par: Robertson, Neil, et autres
Publié: (2024)

Excluding disjoint Kuratowski graphs
par: Robertson, Neil, et autres
Publié: (2024)

Note on the thickness of the Cartesian product of a complete graph and a path
par: Noguchi, Kenta
Publié: (2026)

Antidirected trees in directed graphs
par: Kontogeorgiou, George, et autres
Publié: (2025)

A note on interval colourings of graphs
par: Axenovich, Maria, et autres
Publié: (2023)

The reducibility of optimal 1-planar graphs
par: Zhang, Licheng, et autres
Publié: (2022)

B-colorings of planar and outerplanar graphs
par: Martin, Ryan R., et autres
Publié: (2024)

Planar graphs having no cycle of length $4$, $6$ or $8$ are DP-3-colorable
par: Jin, Ligang, et autres
Publié: (2024)

The minimum crossing number and minimum size of maximal 1-plane graphs with given connectivity
par: Ouyang, Zhangdong, et autres
Publié: (2025)

A sufficient condition for cubic 3-connected plane bipartite graphs to be hamiltonian
par: Florek, Jan
Publié: (2023)