Counting Kernels in Directed Graphs with Arbitrary Orientations
Fuente:
arXiv
Guardado en:
| Autor principal: | Jartoux, Bruno |
|---|---|
| Formato: | Preprint |
| Publicado: |
2022
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Completely independent spanning trees in the hypercube
por: Shaw, Benedict Randall
Publicado: (2024)
por: Shaw, Benedict Randall
Publicado: (2024)
Directed Capacity-Preserving Subgraphs: Hardness and Exact Polynomial Algorithms
por: Chimani, Markus, et al.
Publicado: (2023)
por: Chimani, Markus, et al.
Publicado: (2023)
Independent Set Enumeration in King Graphs by Tensor Network Contractions
por: Liang, Kai
Publicado: (2025)
por: Liang, Kai
Publicado: (2025)
Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
por: Choi, Mujin, et al.
Publicado: (2025)
por: Choi, Mujin, et al.
Publicado: (2025)
Quickly excluding an annotated planar graph
por: Gorsky, Maximilian, et al.
Publicado: (2026)
por: Gorsky, Maximilian, et al.
Publicado: (2026)
The price of homogeneity is polynomial
por: Gorsky, Maximilian, et al.
Publicado: (2026)
por: Gorsky, Maximilian, et al.
Publicado: (2026)
Monotone Arc Diagrams with few Biarcs
por: Chaplick, Steven, et al.
Publicado: (2024)
por: Chaplick, Steven, et al.
Publicado: (2024)
Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
por: Chimani, Markus, et al.
Publicado: (2021)
por: Chimani, Markus, et al.
Publicado: (2021)
Lower Bounds for the Pfaffian Number of Graphs
por: Junchaya, Enrique, et al.
Publicado: (2026)
por: Junchaya, Enrique, et al.
Publicado: (2026)
Simple Approximations for General Spanner Problems
por: Bökler, Fritz, et al.
Publicado: (2025)
por: Bökler, Fritz, et al.
Publicado: (2025)
Exact Minimum Weight Spanners via Column Generation
por: Bökler, Fritz, et al.
Publicado: (2024)
por: Bökler, Fritz, et al.
Publicado: (2024)
Conflict-Free Colouring of Subsets
por: Jartoux, Bruno, et al.
Publicado: (2022)
por: Jartoux, Bruno, et al.
Publicado: (2022)
Almost Bipartite non-König-Egerváry Graphs Revisited
por: Levit, Vadim E., et al.
Publicado: (2024)
por: Levit, Vadim E., et al.
Publicado: (2024)
Optimal Bounds for the k-Disjoint Paths Problem
por: Cavallaro, Dario, et al.
Publicado: (2026)
por: Cavallaro, Dario, et al.
Publicado: (2026)
How Local Separators Shape Community Structure in Large Networks
por: Frenkel, Sarah, et al.
Publicado: (2025)
por: Frenkel, Sarah, et al.
Publicado: (2025)
On the spectra of prefix-reversal graphs
por: Blanco, Saúl A., et al.
Publicado: (2025)
por: Blanco, Saúl A., et al.
Publicado: (2025)
Adjacent vertex distinguishing total coloring of 3-degenerate graphs
por: Behera, Diptimaya, et al.
Publicado: (2025)
por: Behera, Diptimaya, et al.
Publicado: (2025)
Some integer values in the spectra of burnt pancake graphs
por: Blanco, Saúl A., et al.
Publicado: (2024)
por: Blanco, Saúl A., et al.
Publicado: (2024)
On the Number of Vertices/Edges whose Deletion Preserves the Konig-Egervary Property
por: Levit, Vadim E., et al.
Publicado: (2024)
por: Levit, Vadim E., et al.
Publicado: (2024)
On corona of Konig-Egervary graphs
por: Levit, Vadim E., et al.
Publicado: (2024)
por: Levit, Vadim E., et al.
Publicado: (2024)
Homomorphism Counts to Trees
por: Dawar, Anuj
Publicado: (2024)
por: Dawar, Anuj
Publicado: (2024)
Secure Total Domination Number in Maximal Outerplanar Graphs
por: Aita, Yasufumi, et al.
Publicado: (2024)
por: Aita, Yasufumi, et al.
Publicado: (2024)
Log-concavity of the independence polynomials of $\mathbf{W}_{p}$ graphs
por: Hoang, Do Trong, et al.
Publicado: (2024)
por: Hoang, Do Trong, et al.
Publicado: (2024)
A Lower bound for Secure Domination Number of an Outerplanar Graph
por: Araki, Toru
Publicado: (2024)
por: Araki, Toru
Publicado: (2024)
Temporalizing digraphs via linear-size balanced bi-trees
por: Bessy, Stéphane, et al.
Publicado: (2023)
por: Bessy, Stéphane, et al.
Publicado: (2023)
On the Metric Dimension of $K_a \times K_b \times K_c$
por: Gledel, Valentin, et al.
Publicado: (2024)
por: Gledel, Valentin, et al.
Publicado: (2024)
A note on the structure of locally finite planar quasi-transitive graphs
por: Giocanti, Ugo
Publicado: (2024)
por: Giocanti, Ugo
Publicado: (2024)
Independent Set Enumeration and Estimation of Related Constants of Grid Graphs and Their Variants
por: Liang, Kai
Publicado: (2025)
por: Liang, Kai
Publicado: (2025)
The Directed Disjoint Paths Problem with Congestion
por: Bentert, Matthias, et al.
Publicado: (2025)
por: Bentert, Matthias, et al.
Publicado: (2025)
On the Relation Between Treewidth, Tree-Independence Number, and Tree-Chromatic Number of Graphs
por: Koutsoutis, Alex, et al.
Publicado: (2025)
por: Koutsoutis, Alex, et al.
Publicado: (2025)
Topological Indices With Degree Sequence $\mathscr{D}$ of Tree
por: Hamoud, Jasem, et al.
Publicado: (2025)
por: Hamoud, Jasem, et al.
Publicado: (2025)
Metrics on Permutation Families Defined by a Restriction Graph
por: Tymoshenko, Danylo, et al.
Publicado: (2025)
por: Tymoshenko, Danylo, et al.
Publicado: (2025)
Bounds on the Twin-Width of Product Graphs
por: Pettersson, William, et al.
Publicado: (2022)
por: Pettersson, William, et al.
Publicado: (2022)
A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
por: Rockel-Wolff, Benjamin
Publicado: (2024)
por: Rockel-Wolff, Benjamin
Publicado: (2024)
Golden Ratio Growth and Phase Transitions in Chromatic Counts of Circular Chord Graphs
por: Lopez-Bonilla, Rogelio N., et al.
Publicado: (2025)
por: Lopez-Bonilla, Rogelio N., et al.
Publicado: (2025)
The Leaf Function of Penrose P2 Graphs
por: Porrier, Carole, et al.
Publicado: (2023)
por: Porrier, Carole, et al.
Publicado: (2023)
Recognizing Relating Edges in Graphs without Cycles of Length 6
por: Levit, Vadim E., et al.
Publicado: (2024)
por: Levit, Vadim E., et al.
Publicado: (2024)
Low Recourse Arborescence Forests Under Uniformly Random Arcs
por: Dahlmeier, J Niklas, et al.
Publicado: (2025)
por: Dahlmeier, J Niklas, et al.
Publicado: (2025)
Polynomial Bounds for the Graph Minor Structure Theorem
por: Gorsky, Maximilian, et al.
Publicado: (2025)
por: Gorsky, Maximilian, et al.
Publicado: (2025)
A coarse Menger's Theorem for planar and bounded genus graphs
por: Blažej, Václav, et al.
Publicado: (2026)
por: Blažej, Václav, et al.
Publicado: (2026)
Ejemplares similares
-
Completely independent spanning trees in the hypercube
por: Shaw, Benedict Randall
Publicado: (2024) -
Directed Capacity-Preserving Subgraphs: Hardness and Exact Polynomial Algorithms
por: Chimani, Markus, et al.
Publicado: (2023) -
Independent Set Enumeration in King Graphs by Tensor Network Contractions
por: Liang, Kai
Publicado: (2025) -
Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
por: Choi, Mujin, et al.
Publicado: (2025) -
Quickly excluding an annotated planar graph
por: Gorsky, Maximilian, et al.
Publicado: (2026)