Image de couverture de livre

Degenerate Vertex Cuts in Sparse Graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Hartel, Thilo, Rauch, Johannes, Rautenbach, Dieter
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Forest Cuts in Sparse Graphs
par: Chernyshev, Vsevolod, et autres
Publié: (2024)

Revisiting Extremal Graphs Having No Stable Cutsets
par: Rauch, Johannes, et autres
Publié: (2024)

On the number of maximal independent sets and maximal induced bipartite subgraphs in $K_4$-free graphs
par: Hartel, Thilo, et autres
Publié: (2025)

Cutwidth and Crossings
par: Rauch, Johannes, et autres
Publié: (2025)

Vertex Ranking of Degenerate Graphs
par: Iacono, John, et autres
Publié: (2024)

An Optimization Approach to Degree Deviation and Spectral Radius
par: Rautenbach, Dieter, et autres
Publié: (2024)

Degree Deviation and Spectral Radius
par: Rautenbach, Dieter, et autres
Publié: (2024)

Induced Subforests and Superforests
par: Rautenbach, Dieter, et autres
Publié: (2024)

A Faster Algorithm for Independent Cut
par: Chernyshev, Vsevolod, et autres
Publié: (2025)

Leaf to leaf path lengths in trees of given degree sequence
par: Rautenbach, Dieter, et autres
Publié: (2025)

Coloring by Pushing Vertices
par: Rautenbach, Dieter, et autres
Publié: (2025)

Majority additive coloring and the maximum degree
par: Brause, Christoph, et autres
Publié: (2025)

Largest common subgraph of two forests
par: Rautenbach, Dieter, et autres
Publié: (2024)

Computing Subset Vertex Covers in $H$-Free Graphs
par: Brettell, Nick, et autres
Publié: (2023)

Conflict-Free Cuts in Planar and 3-Degenerate Graphs with 1-Regular Conflicts
par: Kalyanasundaram, Subrahmanyam, et autres
Publié: (2026)

A Note on Large Degenerate Induced Subgraphs in Sparse Graphs
par: Clow, Alexander, et autres
Publié: (2025)

Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs
par: Botler, F., et autres
Publié: (2024)

On the Induced Neighbourhood of Vertex-Transitive Graphs
par: Joshi, Aditya
Publié: (2025)

Vertex Partitioning and $p$-Energy of Graphs
par: Akbari, Saieed, et autres
Publié: (2025)

Colouring Probe $H$-Free Graphs
par: Paulusma, Daniël, et autres
Publié: (2025)

Local Distance Antimagic Vertex Coloring of Graphs
par: T, Divya, et autres
Publié: (2021)

Gathering Information about a Graph by Counting Walks from a Single Vertex
par: Fuhlbrück, Frank, et autres
Publié: (2024)

Maximum Spread of Vertex Degrees in a Simple Graph
par: Onishchenko, Sergey Dmitrievich
Publié: (2025)

Hamilton Cycles In Vertex-Transitive Graphs of Order 10p
par: Chen, Huye, et autres
Publié: (2025)

Zero Forcing and Vertex Independence Number on Cubic and Subcubic Graphs
par: Schuerger, Houston, et autres
Publié: (2024)

Prime Vertex Labelings of Several Families of Graphs
par: Diefenderfer, Nathan, et autres
Publié: (2015)

Shellability of $3$-Cut Complexes of Squared Cycle Graphs
par: Chauhan, Pratiksha, et autres
Publié: (2024)

Any Three Longest Paths In A Connected Graph Has A Common Vertex
par: Sarkar, Nirankush
Publié: (2020)

Computing Vertex and Edge Connectivity of Graphs Embedded with Crossings
par: Biedl, Therese, et autres
Publié: (2024)

Upper Bounds on the Acyclic Chromatic Index of Degenerate Graphs
par: Anto, Nevil, et autres
Publié: (2023)

Extremal Mostar Index of Graphs with Given Number of Cut Edges
par: Hosamani, Sunilkumar M.
Publié: (2026)

Lipschitz Functions on Sparse Graphs
par: Korsky, Samuel, et autres
Publié: (2024)

Hamiltonicity of Sparse Pseudorandom Graphs
par: Ferber, Asaf, et autres
Publié: (2024)

Vertex-transitive Neumaier graphs
par: Jazaeri, Mojtaba
Publié: (2024)

On Computing Vertex Connectivity of 1-Plane Graphs
par: Biedl, Therese, et autres
Publié: (2022)

On the Vertex Seidel Energy of Graphs
par: Popat, Kalpesh M., et autres
Publié: (2026)

Lipschitz Functions on Sparse Graphs II
par: Korsky, Samuel
Publié: (2026)

Vertex-distinguishing edge coloring of graphs
par: Gao, Yuping, et autres
Publié: (2025)

Tangles are Decided by Weighted Vertex Sets
par: Elbracht, Christian, et autres
Publié: (2018)

Gathering in Non-Vertex-Transitive Graphs Under Round Robin
par: Cicerone, Serafino, et autres
Publié: (2025)