Minimum Spanning Trees with Bounded Degrees of Vertices in a Specified Stable Set
Fuente:
arXiv
Guardado en:
| Autores principales: | Brause, Christoph, Harant, Jochen, Hörsch, Florian, Mohr, Samuel |
|---|---|
| Formato: | Preprint |
| Publicado: |
2022
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Minimum Spanning Tree Cycle Intersection Problem
por: Dubinsky, Manuel, et al.
Publicado: (2021)
por: Dubinsky, Manuel, et al.
Publicado: (2021)
Complexity results on the decomposition of a digraph into directed linear forests and out-stars
por: Hörsch, Florian, et al.
Publicado: (2024)
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)
por: Hörsch, Florian, et al.
Publicado: (2026)
Diameter of the inversion graph
por: Havet, Frédéric, et al.
Publicado: (2024)
por: Havet, Frédéric, et al.
Publicado: (2024)
On the minimum number of inversions to make a digraph $k$-(arc-)strong
por: Duron, Julien, et al.
Publicado: (2023)
por: Duron, Julien, et al.
Publicado: (2023)
Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees
por: Gerke, Stefanie, et al.
Publicado: (2024)
por: Gerke, Stefanie, et al.
Publicado: (2024)
String Graph Obstacles of High Girth and of Bounded Degree
por: Chudnovsky, Maria, et al.
Publicado: (2025)
por: Chudnovsky, Maria, et al.
Publicado: (2025)
Large Induced Subgraphs of Bounded Degree in Outerplanar and Planar Graphs
por: D'Elia, Marco, et al.
Publicado: (2024)
por: D'Elia, Marco, et al.
Publicado: (2024)
Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pending Vertices
por: Devillez, Gauvain, et al.
Publicado: (2018)
por: Devillez, Gauvain, et al.
Publicado: (2018)
A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs
por: Zhang, Jiechen
Publicado: (2026)
por: Zhang, Jiechen
Publicado: (2026)
A Survey of Cameron-Liebler Sets and Low Degree Boolean Functions in Grassmann Graphs
por: Ihringer, Ferdinand
Publicado: (2024)
por: Ihringer, Ferdinand
Publicado: (2024)
Circulant TSP: Vertices of the Edge-Length Polytope and Superpolynomial Lower Bounds
por: Gutekunst, Samuel C.
Publicado: (2025)
por: Gutekunst, Samuel C.
Publicado: (2025)
Cycles of Well-Linked Sets II: an Elementary Bound for the Directed Grid Theorem
por: Hatzel, Meike, et al.
Publicado: (2026)
por: Hatzel, Meike, et al.
Publicado: (2026)
Constrained Flips in Plane Spanning Trees
por: Aichholzer, Oswin, et al.
Publicado: (2025)
por: Aichholzer, Oswin, et al.
Publicado: (2025)
Flipping Non-Crossing Spanning Trees
por: Bjerkevik, Håvard Bakke, et al.
Publicado: (2024)
por: Bjerkevik, Håvard Bakke, et al.
Publicado: (2024)
Problems on Group-labeled Matroid Bases
por: Hörsch, Florian, et al.
Publicado: (2024)
por: Hörsch, Florian, et al.
Publicado: (2024)
Bounds on Linear Turán Number for Trees
por: Adak, Rajat, et al.
Publicado: (2026)
por: Adak, Rajat, et al.
Publicado: (2026)
Characterization of Double-Arborescences and their Minimum-Word-Representants
por: Dwary, Tithi, et al.
Publicado: (2024)
por: Dwary, Tithi, et al.
Publicado: (2024)
Minimum length word-representants of graph products
por: Srinivasan, Eshwar, et al.
Publicado: (2024)
por: Srinivasan, Eshwar, et al.
Publicado: (2024)
Lower Bounds for the Minimum Spanning Tree Cycle Intersection Problem
por: Dubinsky, Manuel, et al.
Publicado: (2024)
por: Dubinsky, Manuel, et al.
Publicado: (2024)
Optimal Tree-Decompositions with Bags of Bounded Treewidth
por: Hendrey, Kevin, et al.
Publicado: (2025)
por: Hendrey, Kevin, et al.
Publicado: (2025)
Enumeration of Tree-like Multigraphs with a Given Number of Vertices, Self-loops and Multiple Edges
por: Azam, Naveed Ahmed, et al.
Publicado: (2025)
por: Azam, Naveed Ahmed, et al.
Publicado: (2025)
Pushing Cops and Robber on Graphs of Maximum Degree 4
por: Gahlawat, Harmender
Publicado: (2025)
por: Gahlawat, Harmender
Publicado: (2025)
Upper Bounds on the Average Height of Random Binary Trees
por: Benkner, Louisa Seelbach
Publicado: (2024)
por: Benkner, Louisa Seelbach
Publicado: (2024)
New Results on Vertices that Belong to Every Minimum Locating-Dominating Code
por: Junnila, Ville, et al.
Publicado: (2025)
por: Junnila, Ville, et al.
Publicado: (2025)
Computational Complexity of Covering Colored Mixed Multigraphs with Simple Degree Partitions
por: Bok, Jan, et al.
Publicado: (2025)
por: Bok, Jan, et al.
Publicado: (2025)
On Sets of Monochromatic Objects in Bicolored Point Sets
por: Bhore, Sujoy, et al.
Publicado: (2026)
por: Bhore, Sujoy, et al.
Publicado: (2026)
On Euler Paths and the Maximum Degree Growth of Iterated Higher Order Line Graphs
por: Sanghi, Aryan, et al.
Publicado: (2026)
por: Sanghi, Aryan, et al.
Publicado: (2026)
Minimum number of arcs in $k$-critical digraphs with order at most $2k-1$
por: Picasarri-Arrieta, Lucas, et al.
Publicado: (2023)
por: Picasarri-Arrieta, Lucas, et al.
Publicado: (2023)
Bounds on Path Energy of Graphs
por: Narke, Amol P., et al.
Publicado: (2022)
por: Narke, Amol P., et al.
Publicado: (2022)
Feedback Arc Sets and Feedback Arc Set Decompositions in Weighted and Unweighted Oriented Graphs
por: Gutin, Gregory, et al.
Publicado: (2025)
por: Gutin, Gregory, et al.
Publicado: (2025)
Connected Dominating Sets in Triangulations
por: Bose, Prosenjit, et al.
Publicado: (2023)
por: Bose, Prosenjit, et al.
Publicado: (2023)
Lower Bounds for Induced-Universal Graphs
por: Gavoille, Cyril, et al.
Publicado: (2025)
por: Gavoille, Cyril, et al.
Publicado: (2025)
Polynomial Bounds in the Apex Minor Theorem
por: Hendrey, Kevin, et al.
Publicado: (2025)
por: Hendrey, Kevin, et al.
Publicado: (2025)
Bounds on the Complete Forcing Number of Graphs
por: Ebrahimi, Javad B., et al.
Publicado: (2024)
por: Ebrahimi, Javad B., et al.
Publicado: (2024)
Supports for Outerplanar and Bounded Treewidth Graphs
por: Raman, Rajiv, et al.
Publicado: (2025)
por: Raman, Rajiv, et al.
Publicado: (2025)
Lower Bounds for Maximum Weighted Cut
por: Gutin, Gregory, et al.
Publicado: (2021)
por: Gutin, Gregory, et al.
Publicado: (2021)
Minimum stationary values of sparse random directed graphs
por: Cai, Xing Shi, et al.
Publicado: (2020)
por: Cai, Xing Shi, et al.
Publicado: (2020)
An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality
por: Laddha, Aditi, et al.
Publicado: (2025)
por: Laddha, Aditi, et al.
Publicado: (2025)
Maximal Independent Sets in Planar Triangulations
por: Francis, P., et al.
Publicado: (2024)
por: Francis, P., et al.
Publicado: (2024)
Ejemplares similares
-
Minimum Spanning Tree Cycle Intersection Problem
por: Dubinsky, Manuel, et al.
Publicado: (2021) -
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) -
Diameter of the inversion graph
por: Havet, Frédéric, et al.
Publicado: (2024) -
On the minimum number of inversions to make a digraph $k$-(arc-)strong
por: Duron, Julien, et al.
Publicado: (2023)