Imagen de Portada

Geodetic Graphs: Experiments and New Constructions

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Stober, Florian, Weiß, Armin
Formato:	Preprint
Publicado:	2023
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

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

Block Designs and K-Geodetic Graphs: A Survey
por: Frasser, Carlos E.
Publicado: (2025)

The Closed Geodetic Game: algorithms and strategies
por: Dailly, Antoine, et al.
Publicado: (2024)

On 3-Connected Cubic Planar Graphs and their Strong Embeddings on Orientable Surfaces
por: Weiß, Meike, et al.
Publicado: (2025)

On 3-Connected Planar Graphs with Unique Orientable Circuit Double Covers
por: Weiß, Meike, et al.
Publicado: (2026)

Onion De Bruijn Sequences: Fixed-Window Counting by Growing the Alphabet
por: Genosar, Dor, et al.
Publicado: (2019)

A unified convention for achievement positional games
por: Galliot, Florian, et al.
Publicado: (2025)

Complexity results on the decomposition of a digraph into directed linear forests and out-stars
por: Hörsch, Florian, et al.
Publicado: (2024)

Increasing arc-connectivity by bounded- and fixed-size inversions
por: Hörsch, Florian, 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)

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

Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
por: Bhyravarapu, Sriram, et al.
Publicado: (2021)

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

Maker-Breaker is solved in polynomial time on hypergraphs of rank 3
por: Galliot, Florian, et al.
Publicado: (2022)

The Avoider-Enforcer game on hypergraphs of rank 3
por: Galliot, Florian, et al.
Publicado: (2025)

On Threshold Compatibility Graphs
por: Hakim, Sheikh Azizul, et al.
Publicado: (2026)

Line Graphs of Non-Word-Representable Graphs are Not Always Non-Word-Representable
por: Mozhui, Khyodeno, et al.
Publicado: (2025)

Asynchronous dynamics of isomorphic Boolean networks
por: Bridoux, Florian, et al.
Publicado: (2024)

Interaction graphs of isomorphic automata networks II: universal dynamics
por: Bridoux, Florian, et al.
Publicado: (2024)

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

Word-Representation of Melon Graphs
por: Mozhui, Khyodeno, et al.
Publicado: (2026)

Enumerating Two-Orbit Graphs
por: Seka, David, et al.
Publicado: (2026)

Word-Representability of Shift Graphs
por: Roy, Suchanda, et al.
Publicado: (2026)

Bounds on Path Energy of Graphs
por: Narke, Amol P., et al.
Publicado: (2022)

Graph Reconstruction with Connectivity Queries
por: Kluk, Kacper, et al.
Publicado: (2024)

On Realizing Reconfiguration Graphs of Cliques
por: Hoang, Duc A.
Publicado: (2026)

On Generalizations of Pairwise Compatibility Graphs
por: Calamoneri, Tiziana, et al.
Publicado: (2021)

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

On a Characterization of Spartan Graphs
por: Misra, Neeldhara, et al.
Publicado: (2025)

On the Cop Number of String Graphs
por: Das, Sandip, et al.
Publicado: (2024)

Characterization of Split Comparability Graphs
por: Dwary, Tithi, et al.
Publicado: (2025)

On Tuza's Conjecture in Dense Graphs
por: Chahua, Luis, et al.
Publicado: (2024)

Vertex Ranking of Degenerate Graphs
por: Iacono, John, et al.
Publicado: (2024)

Ramanujan Graphs and Interlacing Families
por: Srivastava, Nikhil
Publicado: (2024)

Sparse String Graphs and Region Intersection Graphs over Minor-Closed Classes have Linear Expansion
por: Karol, Nikolai, et al.
Publicado: (2026)

On Separating Path and Tree Systems in Graphs
por: Biniaz, Ahmad, et al.
Publicado: (2023)

Comparing Width Parameters on Graph Classes
por: Brettell, Nick, et al.
Publicado: (2023)

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

HIST-Critical Graphs and Malkevitch's Conjecture
por: Goedgebeur, Jan, et al.
Publicado: (2024)