Imagen de Portada

Preorder Construct on Simple Undirected Graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Santos, Augusto Almeida, Moura, José M. F., Xavier, João
Formato:	Preprint
Publicado:	2017
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Preorder induced by rainbow forbidden subgraphs
por: Maezawa, Shun-ichi, et al.
Publicado: (2025)

A Complete Characterization of the Inverse Eigenvector Centrality Problem for Undirected Graphs
por: Passacantando, Mauro, et al.
Publicado: (2026)

Average-Rare Order Ideals in Functional Preorders
por: Hachimori, Masahiro, et al.
Publicado: (2025)

Neighbor Connectivity of Undirected Toroidal Meshes
por: Huang, Hui-Ming, et al.
Publicado: (2025)

On the Diameter of Undirected Cayley Graphs of Finite Abelian Groups
por: Bajnok, Bela, et al.
Publicado: (2024)

Singular Values Versus Expansion in Directed and Undirected Graphs
por: Ruotolo, Jake, et al.
Publicado: (2025)

Oriented Diameter of Mixed Graphs with Given Maximum Undirected Degree
por: An, Ran, et al.
Publicado: (2025)

The Undirected Optical Indices of Trees
por: Lo, Yuan-Hsun, et al.
Publicado: (2018)

Undirected edge geography games on grids
por: Sereekiatdilok, Tharit, et al.
Publicado: (2025)

On Chip-Firing on Undirected Binary Trees
por: Inagaki, Ryota, et al.
Publicado: (2024)

Infinite Cliques in Simple and Stable Graphs
por: Halevi, Yatir, et al.
Publicado: (2024)

Maximum Spread of Vertex Degrees in a Simple Graph
por: Onishchenko, Sergey Dmitrievich
Publicado: (2025)

Signs of Hamiltonian Circles in Simple Plane Signed Graphs
por: Yan, Xiyong
Publicado: (2026)

EKR-Type Theorems for Pendant Graph Constructions
por: Carrion, Michael, et al.
Publicado: (2025)

Competitively Constructed Planar Graphs
por: Pegden, Wesley, et al.
Publicado: (2025)

Labeled Chip-Firing on Undirected $k$-ary Trees
por: Inagaki, Ryota, et al.
Publicado: (2025)

Intersection Orbital Graphs of Permutation Groups and Reconstruction of Simple Groups
por: Mehry, Shahram
Publicado: (2026)

New Constructions of Distance-Biregular Graphs
por: Fernández, Blas, et al.
Publicado: (2025)

Simple Chopsticks: Playing with any number of hands and fingers
por: Dailly, Antoine, et al.
Publicado: (2024)

Preorders on maximal chains: hyperplane arrangements, Cambrian lattices, and maximal green sequences
por: Gorsky, Mikhail, et al.
Publicado: (2025)

Optimal Constructions for DNA Self-Assembly of $k$-Regular Graphs
por: Baek, Lisa, et al.
Publicado: (2025)

Complexity Framework For Forbidden Subgraphs V: Beyond Simple Graphs
por: Eagling-Vose, Tala, et al.
Publicado: (2025)

Geodetic Graphs: Experiments and New Constructions
por: Stober, Florian, et al.
Publicado: (2023)

Towards Crossing-Free Hamiltonian Cycles in Simple Drawings of Complete Graphs
por: Aichholzer, Oswin, et al.
Publicado: (2023)

Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them
por: Hordan, Snir, et al.
Publicado: (2026)

Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes
por: Kopparty, Swastik, et al.
Publicado: (2023)

Construction and Conditions for Completely Independent Spanning Trees in Hypercubes and Regular Bipartite Graphs
por: Barabde, R., et al.
Publicado: (2024)

Simple games with minimum
por: Kurz, Sascha, et al.
Publicado: (2025)

Fast and Simple $(1+ε)Δ$-Edge-Coloring of Dense Graphs
por: Dhawan, Abhishek
Publicado: (2024)

Quasi Neighborhood Balanced Coloring of Graphs
por: Almeida, Maurice Genevieva
Publicado: (2025)

Constructing Block Designs from Complete Graphs
por: Glancy, Benjamin, et al.
Publicado: (2026)

Explicit Entropic Constructions for Coverage, Facility Location, and Graph Cuts
por: Iyer, Rishabh
Publicado: (2026)

Real Reliability Roots of Simple Graphs are Dense
por: Omar, Mohamed
Publicado: (2026)

A Discrete Logarithm Construction for Orthogonal Double Covers of the Complete Graph by Hamiltonian Paths
por: Ollis, M. A.
Publicado: (2025)

Local Distance Antimagic Labeling of Neighborhood Balanced Graphs
por: Almeida, Maurice Genevieva
Publicado: (2025)

Simple factor graphs associated with split graphs
por: Pastine, Adrian, et al.
Publicado: (2025)

Cover-free families on graphs
por: Parida, Prangya, et al.
Publicado: (2026)

Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs
por: Botler, F., et al.
Publicado: (2024)

Conformal Rigidity and Spectral Embeddings of Graphs
por: Gouveia, João, et al.
Publicado: (2025)

Probabilistic Generation of Finite Almost Simple Groups
por: Fulman, Jason, et al.
Publicado: (2024)