:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Onishchenko, Sergey Dmitrievich
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2509.21429
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Efficient Enumeration of Cliques in Graphs with Bounded Maximum Degree
by: Gong, Shi-Cai, et al.
Published: (2026)

2-Distance Coloring of Planar Graphs with Specific Maximum Degree
by: Hajjar, Sara Al
Published: (2025)

Proper Conflict-free Coloring of Graphs with Large Maximum Degree
by: Cranston, Daniel W., et al.
Published: (2022)

Pushing Cops and Robber on Graphs of Maximum Degree 4
by: Gahlawat, Harmender
Published: (2025)

Judicious Partitions in Edge-Weighted Graphs with Bounded Maximum Weighted Degree
by: Gutin, G., et al.
Published: (2025)

On Wegner's 8-Coloring Theorem for Planar Graphs of Maximum Degree Three
by: Elvin, Gabriel, et al.
Published: (2025)

Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees
by: Gerke, Stefanie, et al.
Published: (2024)

Cliques and High Odd Holes in Graphs with Chromatic Number Equal to Maximum Degree
by: Galindo, Rachel, et al.
Published: (2025)

On the Maximum Spread of Non-Negative Matrices
by: Lu, Susie, et al.
Published: (2025)

Spanning Factorizations in Vertex-Transitive Digraphs of Degree 2
by: Faber, Vance
Published: (2025)

On Euler Paths and the Maximum Degree Growth of Iterated Higher Order Line Graphs
by: Sanghi, Aryan, et al.
Published: (2026)

Odd Induced Subgraphs in Graphs of Maximum Degree Four
by: Ai, Jiangdong, et al.
Published: (2025)

On the Spread of Graph-Related Matrices
by: Liu, Lele, et al.
Published: (2024)

On the Induced Neighbourhood of Vertex-Transitive Graphs
by: Joshi, Aditya
Published: (2025)

Vertex Partitioning and $p$-Energy of Graphs
by: Akbari, Saieed, et al.
Published: (2025)

Degenerate Vertex Cuts in Sparse Graphs
by: Hartel, Thilo, et al.
Published: (2025)

Vertex Ranking of Degenerate Graphs
by: Iacono, John, et al.
Published: (2024)

Local Distance Antimagic Vertex Coloring of Graphs
by: T, Divya, et al.
Published: (2021)

A Linear Bound on the Rich Flow Number for Graphs with a Given Maximum Degree
by: Lukoťka, Robert
Published: (2026)

Oriented Diameter of Mixed Graphs with Given Maximum Undirected Degree
by: An, Ran, et al.
Published: (2025)

Spanning Components and Surfaces Under Minimum Vertex Degree
by: Allsop, Jack, et al.
Published: (2025)

Maximizing the Maximum Degree in Ordered Nearest Neighbor Graphs
by: Ágoston, Péter, et al.
Published: (2024)

Cliques in Squares of Graphs with Maximum Average Degree less than 4
by: Cranston, Daniel W., et al.
Published: (2023)

Hamilton Cycles In Vertex-Transitive Graphs of Order 10p
by: Chen, Huye, et al.
Published: (2025)

Zero Forcing and Vertex Independence Number on Cubic and Subcubic Graphs
by: Schuerger, Houston, et al.
Published: (2024)

Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure
by: Dujmović, Vida, et al.
Published: (2022)

Degrees and Connectivities of a Graph and Its $δ$-Complement
by: Srisawat, Supakorn, et al.
Published: (2024)

Degree-Similar Graphs
by: Godsil, Chris, et al.
Published: (2024)

Prime Vertex Labelings of Several Families of Graphs
by: Diefenderfer, Nathan, et al.
Published: (2015)

A Simple Sub-Polynomial Degree Coboundary Expander
by: Hopkins, Max, et al.
Published: (2026)

Computational Complexity of Covering Colored Mixed Multigraphs with Simple Degree Partitions
by: Bok, Jan, et al.
Published: (2025)

Computing Vertex and Edge Connectivity of Graphs Embedded with Crossings
by: Biedl, Therese, et al.
Published: (2024)

Triangle-free Graphs with Large Minimum Common Degree
by: Wang, Jian, et al.
Published: (2024)

On 13-Crossing-Critical Graphs with Arbitrarily Large Degrees
by: Hliněný, Petr, et al.
Published: (2021)

Partition of Sparse Graphs into Two Forests with Bounded Degree
by: Yancey, Matthew
Published: (2024)

On the Vertex Seidel Energy of Graphs
by: Popat, Kalpesh M., et al.
Published: (2026)

Gathering Information about a Graph by Counting Walks from a Single Vertex
by: Fuhlbrück, Frank, et al.
Published: (2024)

On Computing Vertex Connectivity of 1-Plane Graphs
by: Biedl, Therese, et al.
Published: (2022)

Any Three Longest Paths In A Connected Graph Has A Common Vertex
by: Sarkar, Nirankush
Published: (2020)

On Maximum Induced Forests of the Balanced Bipartite Graphs
by: Ghalavand, Ali, et al.
Published: (2025)