Packing cycles in undirected group-labelled graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | Thomas, Robin, Yoo, Youngho |
|---|---|
| Formato: | Preprint |
| Publicado: |
2020
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Packing $A$-paths of length zero modulo a prime
por: Thomas, Robin, et al.
Publicado: (2020)
por: Thomas, Robin, et al.
Publicado: (2020)
Erdős-Pósa property of $A$-paths in unoriented group-labelled graphs
por: Kwon, O-joung, et al.
Publicado: (2024)
por: Kwon, O-joung, et al.
Publicado: (2024)
A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
por: Gollin, J. Pascal, et al.
Publicado: (2022)
por: Gollin, J. Pascal, et al.
Publicado: (2022)
Tight minimum degree conditions for apex-outerplanar minors and subdivisions in graphs and digraphs
por: Liu, Chun-Hung, et al.
Publicado: (2024)
por: Liu, Chun-Hung, et al.
Publicado: (2024)
Tree-width of a graph excluding an apex-forest or a wheel as a minor
por: Liu, Chun-Hung, et al.
Publicado: (2025)
por: Liu, Chun-Hung, et al.
Publicado: (2025)
On the edge reconstruction of the second immanantal polynomials of undirected graph and digraph
por: Wu, Tingzeng, et al.
Publicado: (2025)
por: Wu, Tingzeng, et al.
Publicado: (2025)
On the edge reconstruction of the second immanantal polynomials of undirected graph and digraph
por: Wu, Tingzeng
Publicado: (2025)
por: Wu, Tingzeng
Publicado: (2025)
Optimal $L(d,1)$-labeling of certain direct graph bundles cycles over cycles and Cartesian graph bundles cycles over cycles
por: Ladinek, Irena Hrastnik
Publicado: (2024)
por: Ladinek, Irena Hrastnik
Publicado: (2024)
An efficient recursive decomposition algorithm for undirected graphs
por: Heng, Pei, et al.
Publicado: (2026)
por: Heng, Pei, et al.
Publicado: (2026)
Optimal $L(2,1)$-labeling of certain strong graph bundles cycles over cycles
por: Ladinek, Irena Hrastnik
Publicado: (2024)
por: Ladinek, Irena Hrastnik
Publicado: (2024)
Geometric characterisation of structural and regular equivalences in undirected (hyper)graphs
por: Eidi, Marzieh, et al.
Publicado: (2025)
por: Eidi, Marzieh, et al.
Publicado: (2025)
On directed and undirected diameters of vertex-transitive graphs
por: Skresanov, Saveliy V.
Publicado: (2023)
por: Skresanov, Saveliy V.
Publicado: (2023)
Homomorphism counting for immersion-closed classes is not isomorphism
por: Jiménez, Andrea, et al.
Publicado: (2026)
por: Jiménez, Andrea, et al.
Publicado: (2026)
Packing subgraphs in regular graphs
por: Letzter, Shoham, et al.
Publicado: (2025)
por: Letzter, Shoham, et al.
Publicado: (2025)
Forbidden paths and cycles in the undirected underlying graph of a 2-quasi best match graph
por: Korchmaros, Annachiara
Publicado: (2024)
por: Korchmaros, Annachiara
Publicado: (2024)
Packing edge disjoint cliques in graphs
por: Balogh, József, et al.
Publicado: (2025)
por: Balogh, József, et al.
Publicado: (2025)
Packing tetrahedrons in edge-weighted graphs
por: Sun, Wanting, et al.
Publicado: (2025)
por: Sun, Wanting, et al.
Publicado: (2025)
Packing coloring of graphs with long paths
por: Furmańczyk, Hanna, et al.
Publicado: (2025)
por: Furmańczyk, Hanna, et al.
Publicado: (2025)
Characterizations of undirected 2-quasi best match graphs
por: Korchmaros, Annachiara, et al.
Publicado: (2025)
por: Korchmaros, Annachiara, et al.
Publicado: (2025)
Packing and finding paths in sparse random graphs
por: Iršič, Vesna, et al.
Publicado: (2024)
por: Iršič, Vesna, et al.
Publicado: (2024)
Packing edge-colorings of subcubic outerplanar graphs
por: Li, Sijin, et al.
Publicado: (2024)
por: Li, Sijin, et al.
Publicado: (2024)
Packing large balanced trees into bipartite graphs
por: Fernandes, Cristina G., et al.
Publicado: (2024)
por: Fernandes, Cristina G., et al.
Publicado: (2024)
5-cycles in the complement of minimal prime graphs
por: Dorton, Micah, et al.
Publicado: (2026)
por: Dorton, Micah, et al.
Publicado: (2026)
$E_A$-cordial labeling of graphs and its implications for $A$-antimagic labeling of trees
por: Cichacz, Sylwia
Publicado: (2024)
por: Cichacz, Sylwia
Publicado: (2024)
Forbidden configurations and dominating bicliques in undirected 2-quasi best match graphs
por: Korchmaros, Annachiara, et al.
Publicado: (2025)
por: Korchmaros, Annachiara, et al.
Publicado: (2025)
Cops and robbers on directed and undirected abelian Cayley graphs
por: Bradshaw, Peter, et al.
Publicado: (2019)
por: Bradshaw, Peter, et al.
Publicado: (2019)
Magic labelling enumeration on pseudo-line graphs and pseudo-cycle graphs
por: Xin, Guoce, et al.
Publicado: (2026)
por: Xin, Guoce, et al.
Publicado: (2026)
Packing independent cliques into planar graphs
por: Biró, Csaba, et al.
Publicado: (2024)
por: Biró, Csaba, et al.
Publicado: (2024)
The structure of group-labeled graphs forbidding an immersion
por: McCarty, Rose, et al.
Publicado: (2026)
por: McCarty, Rose, et al.
Publicado: (2026)
Antimagic labellings of (k, 2)-bipartite biregular graphs
por: Beaudoire, Grégoire, et al.
Publicado: (2024)
por: Beaudoire, Grégoire, et al.
Publicado: (2024)
Fundamental cycles in grid graphs
por: Kielak, Bartłomiej, et al.
Publicado: (2026)
por: Kielak, Bartłomiej, et al.
Publicado: (2026)
Canonical labelling of sparse random graphs
por: Verbitsky, Oleg, et al.
Publicado: (2024)
por: Verbitsky, Oleg, et al.
Publicado: (2024)
Induced paths and cycles in factor graphs of split graphs
por: Schvöllner, Victor N., et al.
Publicado: (2026)
por: Schvöllner, Victor N., et al.
Publicado: (2026)
Distance magic labelings of Cartesian products of cycles
por: Rozman, Ksenija, et al.
Publicado: (2024)
por: Rozman, Ksenija, et al.
Publicado: (2024)
Minimum saturated graphs without $4$-cycles and $5$-cycles
por: Ma, Yue
Publicado: (2025)
por: Ma, Yue
Publicado: (2025)
Longest cycles and longest chordless cycles in $2$-connected graphs
por: Hu, Yanan, et al.
Publicado: (2024)
por: Hu, Yanan, et al.
Publicado: (2024)
A unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
por: Gollin, J. Pascal, et al.
Publicado: (2021)
por: Gollin, J. Pascal, et al.
Publicado: (2021)
Packing chromatic critical graphs with radius at most 2
por: Gür, Aslıhan, et al.
Publicado: (2026)
por: Gür, Aslıhan, et al.
Publicado: (2026)
Robertson's conjecture I. Well-quasi-ordering bounded tree-width graphs by the topological minor relation
por: Liu, Chun-Hung, et al.
Publicado: (2020)
por: Liu, Chun-Hung, et al.
Publicado: (2020)
Colour-biased Hamilton cycles in dense graphs and random graphs
por: Behague, Natalie, et al.
Publicado: (2025)
por: Behague, Natalie, et al.
Publicado: (2025)
Ejemplares similares
-
Packing $A$-paths of length zero modulo a prime
por: Thomas, Robin, et al.
Publicado: (2020) -
Erdős-Pósa property of $A$-paths in unoriented group-labelled graphs
por: Kwon, O-joung, et al.
Publicado: (2024) -
A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
por: Gollin, J. Pascal, et al.
Publicado: (2022) -
Tight minimum degree conditions for apex-outerplanar minors and subdivisions in graphs and digraphs
por: Liu, Chun-Hung, et al.
Publicado: (2024) -
Tree-width of a graph excluding an apex-forest or a wheel as a minor
por: Liu, Chun-Hung, et al.
Publicado: (2025)