Census Dual Graphs: Properties and Random Graph Models
Fuente:
arXiv
Saved in:
| Main Authors: | Anderson, Sara, Cannon, Sarah, Feinberg, Brooke, Friedman, Anne |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Catching Rats in $H$-minor-free Graphs
by: Gorsky, Maximilian, et al.
Published: (2025)
by: Gorsky, Maximilian, et al.
Published: (2025)
Tangled Paths: A Random Graph Model from Mallows Permutations
by: Enright, Jessica, et al.
Published: (2021)
by: Enright, Jessica, et al.
Published: (2021)
A new density limit for unanimity in majority dynamics on random graphs
by: Kim, Jeong Han, et al.
Published: (2025)
by: Kim, Jeong Han, et al.
Published: (2025)
Polynomial Bounds for the Graph Minor Structure Theorem
by: Gorsky, Maximilian, et al.
Published: (2025)
by: Gorsky, Maximilian, et al.
Published: (2025)
The classification of minimally unsatisfiable 2-CNFs -- a fundamental study
by: Abbasizanjani, Hoda, et al.
Published: (2020)
by: Abbasizanjani, Hoda, et al.
Published: (2020)
The Local Structure Theorem for Graph Minors with finite index
by: Paul, Christophe, et al.
Published: (2025)
by: Paul, Christophe, et al.
Published: (2025)
Delineating Half-Integrality of the Erdős-Pósa Property for Minors: the Case of Surfaces
by: Paul, Christophe, et al.
Published: (2024)
by: Paul, Christophe, et al.
Published: (2024)
Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
by: Choi, Mujin, et al.
Published: (2025)
by: Choi, Mujin, et al.
Published: (2025)
Lower Bounds for the Pfaffian Number of Graphs
by: Junchaya, Enrique, et al.
Published: (2026)
by: Junchaya, Enrique, et al.
Published: (2026)
W-state graphs: Structure and Algorithms
by: Gajjala, Rishikesh, et al.
Published: (2026)
by: Gajjala, Rishikesh, et al.
Published: (2026)
Bounds on the Twin-Width of Product Graphs
by: Pettersson, William, et al.
Published: (2022)
by: Pettersson, William, et al.
Published: (2022)
Independent Set Enumeration in King Graphs by Tensor Network Contractions
by: Liang, Kai
Published: (2025)
by: Liang, Kai
Published: (2025)
Metrics on Permutation Families Defined by a Restriction Graph
by: Tymoshenko, Danylo, et al.
Published: (2025)
by: Tymoshenko, Danylo, et al.
Published: (2025)
Quickly excluding an annotated planar graph
by: Gorsky, Maximilian, et al.
Published: (2026)
by: Gorsky, Maximilian, et al.
Published: (2026)
The price of homogeneity is polynomial
by: Gorsky, Maximilian, et al.
Published: (2026)
by: Gorsky, Maximilian, et al.
Published: (2026)
The Leaf Function of Penrose P2 Graphs
by: Porrier, Carole, et al.
Published: (2023)
by: Porrier, Carole, et al.
Published: (2023)
A coarse Menger's Theorem for planar and bounded genus graphs
by: Blažej, Václav, et al.
Published: (2026)
by: Blažej, Václav, et al.
Published: (2026)
Computing the forcing spectrum of outerplanar graphs in polynomial time
by: Gorsky, Maximilian, et al.
Published: (2024)
by: Gorsky, Maximilian, et al.
Published: (2024)
Approximating branchwidth on parametric extensions of planarity
by: Thilikos, Dimitrios M., et al.
Published: (2023)
by: Thilikos, Dimitrios M., et al.
Published: (2023)
Optimal List Recoloring of Subcubic Graphs and Complete Multipartite Graphs
by: De Meyer, Lucas
Published: (2025)
by: De Meyer, Lucas
Published: (2025)
Completely Independent Spanning Trees in Split Graphs: Structural Properties and Complexity
by: Lalou, Mohammed, et al.
Published: (2025)
by: Lalou, Mohammed, et al.
Published: (2025)
On the Boxicity of Line Graphs and of Their Complements
by: Caoduro, Marco, et al.
Published: (2025)
by: Caoduro, Marco, et al.
Published: (2025)
An Overview of Universal Obstructions for Graph Parameters
by: Paul, Christophe, et al.
Published: (2023)
by: Paul, Christophe, et al.
Published: (2023)
Graphs with core(G) = nucleus(G)
by: Levit, Vadim E., et al.
Published: (2026)
by: Levit, Vadim E., et al.
Published: (2026)
Optimal Bounds for the k-Disjoint Paths Problem
by: Cavallaro, Dario, et al.
Published: (2026)
by: Cavallaro, Dario, et al.
Published: (2026)
New Optimal Results on Codes for Location in Graphs
by: Junnila, Ville, et al.
Published: (2023)
by: Junnila, Ville, et al.
Published: (2023)
Coloring Graphs With No Totally Odd Clique Immersion
by: McFarland, Caleb
Published: (2025)
by: McFarland, Caleb
Published: (2025)
Gallai's Path Decomposition for 2-degenerate Graphs
by: Anto, Nevil, et al.
Published: (2022)
by: Anto, Nevil, et al.
Published: (2022)
Bell Numbers and Stirling Numbers of the Mycielskian of Trees
by: Allagan, J., et al.
Published: (2025)
by: Allagan, J., et al.
Published: (2025)
Counting Kernels in Directed Graphs with Arbitrary Orientations
by: Jartoux, Bruno
Published: (2022)
by: Jartoux, Bruno
Published: (2022)
Secure Total Domination Number in Maximal Outerplanar Graphs
by: Aita, Yasufumi, et al.
Published: (2024)
by: Aita, Yasufumi, et al.
Published: (2024)
Temporal Exploration of Random Spanning Tree Models
by: Baguley, Samuel, et al.
Published: (2025)
by: Baguley, Samuel, et al.
Published: (2025)
Killing a Vortex
by: Thilikos, Dimitrios M., et al.
Published: (2022)
by: Thilikos, Dimitrios M., et al.
Published: (2022)
A Lower bound for Secure Domination Number of an Outerplanar Graph
by: Araki, Toru
Published: (2024)
by: Araki, Toru
Published: (2024)
Graphs without a 3-connected subgraph are 4-colorable
by: Bonnet, Édouard, et al.
Published: (2024)
by: Bonnet, Édouard, et al.
Published: (2024)
The Directed Disjoint Paths Problem with Congestion
by: Bentert, Matthias, et al.
Published: (2025)
by: Bentert, Matthias, et al.
Published: (2025)
Completely independent spanning trees in the hypercube
by: Shaw, Benedict Randall
Published: (2024)
by: Shaw, Benedict Randall
Published: (2024)
The partial gossip problem revisited
by: Kokhas, Konstantin, et al.
Published: (2026)
by: Kokhas, Konstantin, et al.
Published: (2026)
A Systematic Approach to Crossing Numbers of Cartesian Products with Paths
by: Asiri, Zayed, et al.
Published: (2024)
by: Asiri, Zayed, et al.
Published: (2024)
Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic
by: Loth, Jesse Campion, et al.
Published: (2022)
by: Loth, Jesse Campion, et al.
Published: (2022)
Similar Items
-
Catching Rats in $H$-minor-free Graphs
by: Gorsky, Maximilian, et al.
Published: (2025) -
Tangled Paths: A Random Graph Model from Mallows Permutations
by: Enright, Jessica, et al.
Published: (2021) -
A new density limit for unanimity in majority dynamics on random graphs
by: Kim, Jeong Han, et al.
Published: (2025) -
Polynomial Bounds for the Graph Minor Structure Theorem
by: Gorsky, Maximilian, et al.
Published: (2025) -
The classification of minimally unsatisfiable 2-CNFs -- a fundamental study
by: Abbasizanjani, Hoda, et al.
Published: (2020)