Number of Edges in 3-Connected Graphs with Cyclic Neighborhoods
Fuente:
arXiv
Saved in:
| Main Authors: | Schneider, Samuel, Ueckerdt, Torsten |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Boundedness and Separation in the Graph Covering Number Framework
by: Goetze, Miriam, et al.
Published: (2025)
by: Goetze, Miriam, et al.
Published: (2025)
The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number
by: Goetze, Miriam, et al.
Published: (2025)
by: Goetze, Miriam, et al.
Published: (2025)
Directed Acyclic Outerplanar Graphs Have Constant Stack Number
by: Jungeblut, Paul, et al.
Published: (2022)
by: Jungeblut, Paul, et al.
Published: (2022)
Recognition Complexity of Subgraphs of k-Connected Planar Cubic Graphs
by: Goetze, Miriam, et al.
Published: (2024)
by: Goetze, Miriam, et al.
Published: (2024)
Cops and Robber -- When Capturing is not Surrounding
by: Jungeblut, Paul, et al.
Published: (2023)
by: Jungeblut, Paul, et al.
Published: (2023)
A Note on Polychromatic Colorings of Shift-Chains
by: Ueckerdt, Torsten
Published: (2024)
by: Ueckerdt, Torsten
Published: (2024)
Intersection Graphs with and without Product Structure
by: Merker, Laura, et al.
Published: (2024)
by: Merker, Laura, et al.
Published: (2024)
Partitioning a Planar Graph into two Triangle-Forests
by: Knauer, Kolja, et al.
Published: (2024)
by: Knauer, Kolja, et al.
Published: (2024)
Clustered independence and bounded treewidth
by: Knauer, Kolja, et al.
Published: (2023)
by: Knauer, Kolja, et al.
Published: (2023)
Edge densities of drawings of graphs with one forbidden cell
by: Hahn, Benedikt, et al.
Published: (2025)
by: Hahn, Benedikt, et al.
Published: (2025)
Primal-Dual Cops and Robber
by: Ha, Minh Tuan, et al.
Published: (2023)
by: Ha, Minh Tuan, et al.
Published: (2023)
Odd coloring graphs with linear neighborhood complexity
by: Davies, James, et al.
Published: (2025)
by: Davies, James, et al.
Published: (2025)
Tight bound on treedepth in terms of pathwidth and longest path
by: Hatzel, Meike, et al.
Published: (2023)
by: Hatzel, Meike, et al.
Published: (2023)
Enumeration of Tree-like Multigraphs with a Given Number of Vertices, Self-loops and Multiple Edges
by: Azam, Naveed Ahmed, et al.
Published: (2025)
by: Azam, Naveed Ahmed, et al.
Published: (2025)
Graphs With the Same Edge Count in Each Neighborhood
by: Sheffield, Nathan S., et al.
Published: (2025)
by: Sheffield, Nathan S., et al.
Published: (2025)
Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pending Vertices
by: Devillez, Gauvain, et al.
Published: (2018)
by: Devillez, Gauvain, et al.
Published: (2018)
A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number
by: Bourneuf, Romain, et al.
Published: (2025)
by: Bourneuf, Romain, et al.
Published: (2025)
Flipping Non-Crossing Spanning Trees
by: Bjerkevik, Håvard Bakke, et al.
Published: (2024)
by: Bjerkevik, Håvard Bakke, et al.
Published: (2024)
Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs
by: Botler, F., et al.
Published: (2024)
by: Botler, F., et al.
Published: (2024)
On the Cop Number of String Graphs
by: Das, Sandip, et al.
Published: (2024)
by: Das, Sandip, et al.
Published: (2024)
Graph Reconstruction with Connectivity Queries
by: Kluk, Kacper, et al.
Published: (2024)
by: Kluk, Kacper, et al.
Published: (2024)
Neighborhood complexity of planar graphs
by: Joret, Gwenaël, et al.
Published: (2023)
by: Joret, Gwenaël, et al.
Published: (2023)
On 3-Connected Cubic Planar Graphs and their Strong Embeddings on Orientable Surfaces
by: Weiß, Meike, et al.
Published: (2025)
by: Weiß, Meike, et al.
Published: (2025)
On 3-Connected Planar Graphs with Unique Orientable Circuit Double Covers
by: Weiß, Meike, et al.
Published: (2026)
by: Weiß, Meike, et al.
Published: (2026)
On the Conjecture of the Representation Number of Bipartite Graphs
by: Mozhui, Khyodeno, et al.
Published: (2025)
by: Mozhui, Khyodeno, et al.
Published: (2025)
Bounds on the Complete Forcing Number of Graphs
by: Ebrahimi, Javad B., et al.
Published: (2024)
by: Ebrahimi, Javad B., et al.
Published: (2024)
Basis Number of Graphs Excluding Minors
by: Geniet, Colin, et al.
Published: (2026)
by: Geniet, Colin, et al.
Published: (2026)
Representation Number of Word-Representable Split Graphs
by: Dwary, Tithi, et al.
Published: (2025)
by: Dwary, Tithi, et al.
Published: (2025)
Paired Disjunctive Domination Number of Middle Graphs
by: Golpek, Hande Tuncel, et al.
Published: (2025)
by: Golpek, Hande Tuncel, et al.
Published: (2025)
Antimagic Labeling of Graphs Using Prime Numbers
by: Islam, Arafat, et al.
Published: (2024)
by: Islam, Arafat, et al.
Published: (2024)
Counting the Number of Domatic Partition of a Graph
by: Alikhani, Saeid, et al.
Published: (2024)
by: Alikhani, Saeid, et al.
Published: (2024)
On 1-Planar Graphs with Bounded Cop-Number
by: Bose, Prosenjit, et al.
Published: (2024)
by: Bose, Prosenjit, et al.
Published: (2024)
Using Graph Theory to Derive Inequalities for the Bell Numbers
by: Hertz, Alain, et al.
Published: (2021)
by: Hertz, Alain, et al.
Published: (2021)
Maximum Eccentric Connectivity Index for Graphs with Given Diameter
by: Hauweele, Pierre, et al.
Published: (2018)
by: Hauweele, Pierre, et al.
Published: (2018)
Cyclic ordering of split matroids
by: Bérczi, Kristóf, et al.
Published: (2024)
by: Bérczi, Kristóf, et al.
Published: (2024)
Backward Arcs in Hamilton Oriented Cycles and Paths in Directed Graphs with Independence Number Two
by: Gerke, S., et al.
Published: (2026)
by: Gerke, S., et al.
Published: (2026)
Palette Sparsification for Graphs with Sparse Neighborhoods
by: Dhawan, Abhishek
Published: (2024)
by: Dhawan, Abhishek
Published: (2024)
Combinatorial Gray codes-an updated survey
by: Mütze, Torsten
Published: (2022)
by: Mütze, Torsten
Published: (2022)
On the Asymptotics of the Connectivity Probability of Random Bipartite Graphs
by: Chinyaev, Boris
Published: (2025)
by: Chinyaev, Boris
Published: (2025)
Hamiltonicity of Schrijver graphs and stable Kneser graphs
by: Mütze, Torsten, et al.
Published: (2024)
by: Mütze, Torsten, et al.
Published: (2024)
Similar Items
-
Boundedness and Separation in the Graph Covering Number Framework
by: Goetze, Miriam, et al.
Published: (2025) -
The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number
by: Goetze, Miriam, et al.
Published: (2025) -
Directed Acyclic Outerplanar Graphs Have Constant Stack Number
by: Jungeblut, Paul, et al.
Published: (2022) -
Recognition Complexity of Subgraphs of k-Connected Planar Cubic Graphs
by: Goetze, Miriam, et al.
Published: (2024) -
Cops and Robber -- When Capturing is not Surrounding
by: Jungeblut, Paul, et al.
Published: (2023)