Imagen de Portada

Homomorphically Full Oriented Graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bellitto, Thomas, Duffy, Christopher, MacGillivray, Gary
Formato:	Preprint
Publicado:	2022
Materias:	Discrete Mathematics Combinatorics 05C60, 05C20, 68Q17
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Edge open packing: complexity, algorithmic aspects, and bounds
por: Brešar, Boštjan, et al.
Publicado: (2024)

WalkSAT is linear on random 2-SAT
por: Berenbrink, Petra, et al.
Publicado: (2024)

Colourings of $(m, n)$-coloured mixed graphs
por: MacGillivray, Gary, et al.
Publicado: (2020)

Linear extensions of finite posets
por: Chan, Swee Hong, et al.
Publicado: (2023)

Fault-tolerant mutual-visibility: complexity and solutions for grid-like networks
por: Cicerone, Serafino, et al.
Publicado: (2025)

Finding cliques and dense subgraphs using edge queries
por: Csóka, Endre, et al.
Publicado: (2023)

Trail Trap: a variant of Partizan Edge Geography
por: Buchanan, Calum, et al.
Publicado: (2024)

Asymptotic size of the Karp-Sipser Core in Configuration Model
por: Chatterjee, Arnab, et al.
Publicado: (2025)

Finite Vertex-colored Ultrahomogeneous Oriented Graphs
por: Heinrich, Irene, et al.
Publicado: (2024)

The random $k$-SAT Gibbs uniqueness threshold revisited
por: Chatterjee, Arnab, et al.
Publicado: (2025)

A dichotomy theorem for $Γ$-switchable $H$-colouring on $m$-edge coloured graphs
por: Brewster, Richard, et al.
Publicado: (2023)

Trifferent codes with small lengths
por: Kurz, Sascha
Publicado: (2023)

Inversion diameter and 2-edge-colored homomorphisms
por: Arana, Carmen, et al.
Publicado: (2026)

Results on three problems on isolation of graphs
por: Borg, Peter, et al.
Publicado: (2026)

Boltzmann Distribution on "Short" Integer Partitions with Power Parts: Limit Laws and Sampling
por: Peyen, Jean C., et al.
Publicado: (2023)

Regular $K_3$-irregular graphs
por: Hak, Artem, et al.
Publicado: (2025)

Symmetry classes of Hamiltonian cycles
por: Baligacs, Julia, et al.
Publicado: (2025)

On Oriented Diameter of Power Graphs
por: Benson, Deepu, et al.
Publicado: (2024)

Graph polynomials: some questions on the edge
por: Farr, Graham, et al.
Publicado: (2024)

Structure and algorithms for graphs excluding grids with small parity breaks as odd-minors
por: Gollin, J. Pascal, et al.
Publicado: (2023)

Cycles of Well-Linked Sets I: an Elementary Bound for Directed Cycle Packing
por: Hatzel, Meike, et al.
Publicado: (2024)

The Cover Time of a (Multiple) Markov Chain with Rational Transition Probabilities is Rational
por: Sylvester, John
Publicado: (2021)

Longest cycles in vertex-transitive and highly connected graphs
por: Groenland, Carla, et al.
Publicado: (2024)

Recognizing Level-k-Based Phylogenetic Networks is NP-Complete
por: Suzuki, Takatora
Publicado: (2026)

The degree-restricted random process is far from uniform
por: Molloy, Michael, et al.
Publicado: (2022)

Oriented trees in $O(k \sqrt{k})$-chromatic digraphs, a subquadratic bound for Burr's conjecture
por: Bessy, Stéphane, et al.
Publicado: (2024)

Randomized Zero Forcing
por: Geneson, Jesse, et al.
Publicado: (2026)

Graphs with unique Grundy dominating sets
por: Brešar, Boštjan, et al.
Publicado: (2021)

Undecidability of the block gluing classes of homshifts
por: Chandgotia, Nishant, et al.
Publicado: (2025)

Isomorphisms between dense random graphs
por: Surya, Erlang, et al.
Publicado: (2023)

An Algorithm to Recover Shredded Random Matrices
por: Atamanchuk, Caelan, et al.
Publicado: (2023)

More algorithmic results for problems of spread of influence in edge-weighted graphs with and without incentives
por: Askari, Siavash, et al.
Publicado: (2024)

Mutual-visibility Coloring of Graphs
por: Babu, Saneesh, et al.
Publicado: (2025)

Time-Biased Random Walks and Robustness of Expanders
por: Olesker-Taylor, Sam, et al.
Publicado: (2024)

Computational complexity of counting coincidences
por: Chan, Swee Hong, et al.
Publicado: (2023)

Cops and Robbers, Clique Covers, and Induced Cycles
por: Clow, Alexander, et al.
Publicado: (2025)

Perfect Graph Modification Problems: An Integer Programming Approach
por: Erdem, Burak Nur, et al.
Publicado: (2025)

Optimal Hardness of Online Algorithms for Large Independent Sets
por: Gamarnik, David, et al.
Publicado: (2025)

On the joint embedding property for cographs and trees
por: Carter, Daniel
Publicado: (2024)

Preferential Attachment When Stable
por: Janson, Svante, et al.
Publicado: (2018)