Chordal graphs with bounded tree-width
Fuente:
arXiv
Saved in:
| Main Authors: | Castellví, Jordi, Drmota, Michael, Noy, Marc, Requilé, Clément |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Limits of chordal graphs with bounded tree-width
by: Castellví, Jordi, et al.
Published: (2023)
by: Castellví, Jordi, et al.
Published: (2023)
Upper bound for the number of maximal dissociation sets in trees
by: Wang, Ziyuan, et al.
Published: (2024)
by: Wang, Ziyuan, et al.
Published: (2024)
Exploring structural properties of $k$-trees and block graphs
by: Markenzon, Lilian, et al.
Published: (2023)
by: Markenzon, Lilian, et al.
Published: (2023)
On enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
by: Wang, Wei, et al.
Published: (2026)
by: Wang, Wei, et al.
Published: (2026)
Effective resistance and spanning trees in complete graphs with distance-class deletions
by: Tamura, Shunya
Published: (2026)
by: Tamura, Shunya
Published: (2026)
Maximum number of spanning trees and connectivity: Graphs with a fixed minimum degree and bipartite graphs
by: Xu, Shaohan, et al.
Published: (2025)
by: Xu, Shaohan, et al.
Published: (2025)
Pseudo-orientable ribbon graphs: Matrix--Quasi-tree Theorem and log-concavity
by: Ding, Changxin, et al.
Published: (2026)
by: Ding, Changxin, et al.
Published: (2026)
An improved bound for strongly regular graphs with smallest eigenvalue $-m$
by: Koolen, Jack, et al.
Published: (2025)
by: Koolen, Jack, et al.
Published: (2025)
The bipartite analogue of a classical spanning tree enumeration formula, Boolean functions, and their applications to counting odd spanning trees
by: Ge, Jun, et al.
Published: (2026)
by: Ge, Jun, et al.
Published: (2026)
A Bose-Laskar-Hoffman theory for $μ$-bounded graphs with fixed smallest eigenvalue
by: Koolen, Jack H., et al.
Published: (2025)
by: Koolen, Jack H., et al.
Published: (2025)
Mutual visibility in Moore graphs and $(d,2)$-graphs with defect
by: B, Tonny K, et al.
Published: (2025)
by: B, Tonny K, et al.
Published: (2025)
Deranged Perfect Matchings on complete graph and balanced complete r-partite graph
by: Deng, Boqing
Published: (2025)
by: Deng, Boqing
Published: (2025)
Symmetric and unimodal independence polynomials of trees
by: Hibi, Takayuki, et al.
Published: (2026)
by: Hibi, Takayuki, et al.
Published: (2026)
Counting paths in directed graphs
by: Hajac, Piotr M., et al.
Published: (2022)
by: Hajac, Piotr M., et al.
Published: (2022)
Generalized Turán problem with bounded matching number
by: Ma, Yue, et al.
Published: (2023)
by: Ma, Yue, et al.
Published: (2023)
Counting geodesic paths in graphs
by: Knor, Martin, et al.
Published: (2026)
by: Knor, Martin, et al.
Published: (2026)
The subpath number of cactus graphs
by: Knor, Martin, et al.
Published: (2025)
by: Knor, Martin, et al.
Published: (2025)
On the minimum number of maximal distance-$k$ independent sets in trees
by: Taletskii, Dmitrii
Published: (2026)
by: Taletskii, Dmitrii
Published: (2026)
A note on plane trees with decreasing labels
by: Cheung, Tsun-Ming, et al.
Published: (2025)
by: Cheung, Tsun-Ming, et al.
Published: (2025)
Triangle-free subsets of the $r$-distance graph of the Hypercube
by: Mukkamala, Padmini, et al.
Published: (2025)
by: Mukkamala, Padmini, et al.
Published: (2025)
On the enumeration of connected sets in finite cylindrical lattice graphs
by: Ma, Hongxia, et al.
Published: (2025)
by: Ma, Hongxia, et al.
Published: (2025)
Subgraphs in random graphs with specified degrees and forbidden edges
by: Larkin, John, et al.
Published: (2025)
by: Larkin, John, et al.
Published: (2025)
On the number of connected edge cover sets in a graph
by: Zare, Mahsa, et al.
Published: (2024)
by: Zare, Mahsa, et al.
Published: (2024)
Reduced clique graphs: a correction to "Chordal graphs and their clique graphs"
by: Mayhew, Dillon, et al.
Published: (2023)
by: Mayhew, Dillon, et al.
Published: (2023)
Enumeration of rooted 3-connected bipartite planar maps
by: Noy, Marc, et al.
Published: (2022)
by: Noy, Marc, et al.
Published: (2022)
Automated Counting of Spanning Trees for Several Infinite Families of Graphs
by: Blanco, Pablo, et al.
Published: (2025)
by: Blanco, Pablo, et al.
Published: (2025)
Gallai-Ramsey multiplicity for rainbow small trees
by: Li, Xueliang, et al.
Published: (2023)
by: Li, Xueliang, et al.
Published: (2023)
On the minimal forts of trees
by: Cameron, Thomas R., et al.
Published: (2025)
by: Cameron, Thomas R., et al.
Published: (2025)
Visibility polynomial of corona of two graphs
by: B, Tonny K, et al.
Published: (2025)
by: B, Tonny K, et al.
Published: (2025)
Asymptotics for the number of bipartite graphs with fixed surplus
by: Clancy Jr, David
Published: (2024)
by: Clancy Jr, David
Published: (2024)
Ramanujan polar graphs
by: Smaldore, Valentino
Published: (2026)
by: Smaldore, Valentino
Published: (2026)
Maximal independent sets in graphs with given matching number
by: Shi, Yongtang, et al.
Published: (2024)
by: Shi, Yongtang, et al.
Published: (2024)
Counterexamples to two conjectures on mean color numbers of graphs
by: Zhai, Wushuang, et al.
Published: (2024)
by: Zhai, Wushuang, et al.
Published: (2024)
The minimum number of detours in a connected graph of minimum degree three
by: Liu, Xining, et al.
Published: (2026)
by: Liu, Xining, et al.
Published: (2026)
The maximum number of paths of a given length in a nonhamiltonian graph
by: Li, Chengli, et al.
Published: (2026)
by: Li, Chengli, et al.
Published: (2026)
Extremal graphs with minimum number of connected subgraphs in a given family
by: Pandey, Dinesh, et al.
Published: (2025)
by: Pandey, Dinesh, et al.
Published: (2025)
The chromatic index of strongly regular graphs
by: Cioaba, Sebastian M., et al.
Published: (2018)
by: Cioaba, Sebastian M., et al.
Published: (2018)
On the number of spanning trees of bicirculant graphs
by: Yang, Jing, et al.
Published: (2026)
by: Yang, Jing, et al.
Published: (2026)
A new conjecture on the inertia of graphs
by: Akbari, Saieed, et al.
Published: (2025)
by: Akbari, Saieed, et al.
Published: (2025)
An algebraic approach to asymptotics of the number of unlabelled bicolored graphs
by: Salch, A.
Published: (2024)
by: Salch, A.
Published: (2024)
Similar Items
-
Limits of chordal graphs with bounded tree-width
by: Castellví, Jordi, et al.
Published: (2023) -
Upper bound for the number of maximal dissociation sets in trees
by: Wang, Ziyuan, et al.
Published: (2024) -
Exploring structural properties of $k$-trees and block graphs
by: Markenzon, Lilian, et al.
Published: (2023) -
On enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
by: Wang, Wei, et al.
Published: (2026) -
Effective resistance and spanning trees in complete graphs with distance-class deletions
by: Tamura, Shunya
Published: (2026)