Imagen de Portada

Algorithmic methods of finite discrete structures. Isomorphism of Nonseparable Graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kurapov, Sergey, Davidovsky, Maxim
Formato:	Preprint
Publicado:	2024
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

Algorithmic methods of finite discrete structures. Automorphism of Nonseparable Graphs
por: Kurapov, Sergey, et al.
Publicado: (2024)

Algorithmic methods of finite discrete structures. Graph clique problem
por: Kurapov, Sergey, et al.
Publicado: (2024)

Algorithmic methods of finite discrete structures. Topological graph drawing (part I)
por: Kurapov, Sergey, et al.
Publicado: (2024)

Algorithmic methods of finite discrete structures. Topological graph drawing (part II)
por: Kurapov, Sergey, et al.
Publicado: (2024)

Algorithmic methods of finite discrete structures. Topological graph drawing (part IV)
por: Kurapov, Sergey, et al.
Publicado: (2025)

Algorithmic methods of finite discrete structures. Topological graph drawing (part III)
por: Kurapov, Sergey, et al.
Publicado: (2025)

Algorithmic methods of finite discrete structures. Hamiltonian cycle of a complete graph and the Traveling salesman problem
por: Kurapov, Sergey, et al.
Publicado: (2024)

Algorithmic methods of finite discrete structures. The Four Color Theorem. Theory, methods, algorithms
por: Kurapov, Sergey, et al.
Publicado: (2024)

Isomorphisms of unit distance graphs of layers
por: Bikeev, Arthur Igorevich
Publicado: (2025)

Testing Isomorphism of Graphs in Polynomial Time
por: Xue, Rui
Publicado: (2023)

An Efficient Genus Algorithm Based on Graph Rotations
por: Metzger, Alexander, et al.
Publicado: (2024)

Isomorphism Testing for Graphs Excluding Small Topological Subgraphs
por: Neuen, Daniel
Publicado: (2020)

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

Exploring Algorithmic Solutions for the Independent Roman Domination Problem in Graphs
por: Paul, Kaustav, et al.
Publicado: (2024)

Computation of Graph Polynomials via Tree Decomposition: Theory, Algorithms, and Python Implementation
por: Bafna, Mehul, et al.
Publicado: (2025)

Computing random $r$-orthogonal Latin squares
por: Bereg, Sergey
Publicado: (2023)

Planar #CSP Equality Corresponds to Quantum Isomorphism -- A Holant Viewpoint
por: Cai, Jin-Yi, et al.
Publicado: (2022)

Isomorphism Testing Parameterized by Genus and Beyond
por: Neuen, Daniel
Publicado: (2021)

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

Boundary rigidity of finite CAT(0) cube complexes
por: Chalopin, Jérémie, et al.
Publicado: (2023)

Substitution discrete plane tilings with $2n$-fold rotational symmetry for odd n
por: Kari, Jarkko, et al.
Publicado: (2020)

A note on the distinct distances problem over finite fields
por: Brukhim, Nataly, et al.
Publicado: (2025)

A Faster Isomorphism Test for Graphs of Small Degree
por: Grohe, Martin, et al.
Publicado: (2018)

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

Graph Theory
por: Gilbert, Jesse D.
Publicado: (2011)

The classification of Boolean degree $1$ functions in high-dimensional finite vector spaces
por: Ihringer, Ferdinand
Publicado: (2023)

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

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

Forbidden Patterns in Mixed Linear Layouts
por: Haun, Deborah, et al.
Publicado: (2024)

Planar Rosa : a family of quasiperiodic substitution discrete plane tilings with $2n$-fold rotational symmetry
por: Kari, Jarkko, et al.
Publicado: (2022)

Algorithms and hardness for Metric Dimension on digraphs
por: Dailly, Antoine, et al.
Publicado: (2023)

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

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)

A lattice on Dyck paths close to the Tamari lattice
por: Baril, Jean-Luc, et al.
Publicado: (2023)

Enumeration in the lattice of $q$-decreasing words
por: Baril, Jean-Luc, et al.
Publicado: (2025)

Delta-system method: a survey
por: Kupavskii, Andrey
Publicado: (2025)

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

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

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