The total chord length of maximal outerplanar graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | Broadus, Haley, Pavelescu, Elena |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
An algorithm for estimating the crossing number of dense graphs, and continuous analogs of the crossing and rectilinear crossing numbers
por: Solé-Pi, Oriol
Publicado: (2024)
por: Solé-Pi, Oriol
Publicado: (2024)
Burning numbers via eigenpolytopes -- Hamming graphs, Johnson graphs, and halved cubes
por: Tanaka, Hajime, et al.
Publicado: (2025)
por: Tanaka, Hajime, et al.
Publicado: (2025)
Computing the forcing spectrum of outerplanar graphs in polynomial time
por: Gorsky, Maximilian, et al.
Publicado: (2024)
por: Gorsky, Maximilian, et al.
Publicado: (2024)
The zero blocking numbers of generalized Kneser graphs and generalized Johnson graphs
por: Lin, Hau-Yi, et al.
Publicado: (2025)
por: Lin, Hau-Yi, et al.
Publicado: (2025)
B-colorings of planar and outerplanar graphs
por: Martin, Ryan R., et al.
Publicado: (2024)
por: Martin, Ryan R., et al.
Publicado: (2024)
A polynomial algorithm to compute the boxicity and threshold dimension of complements of block graphs
por: Caoduro, Marco, et al.
Publicado: (2025)
por: Caoduro, Marco, et al.
Publicado: (2025)
Generating maps on oriented surfaces using the homomorphism principle
por: Brinkmann, Gunnar
Publicado: (2024)
por: Brinkmann, Gunnar
Publicado: (2024)
The zero blocking numbers of grid graphs
por: Lin, Hau-Yi, et al.
Publicado: (2025)
por: Lin, Hau-Yi, et al.
Publicado: (2025)
Zero blocking numbers of graphs with complexity results
por: Lin, Hau-Yi, et al.
Publicado: (2025)
por: Lin, Hau-Yi, et al.
Publicado: (2025)
Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph
por: Borradaile, Glencora, et al.
Publicado: (2017)
por: Borradaile, Glencora, et al.
Publicado: (2017)
Reconstructing a graph from the distance matrix of its boundary
por: Cáceres, José, et al.
Publicado: (2024)
por: Cáceres, José, et al.
Publicado: (2024)
New minor minimal non-apex graphs
por: Pavelescu, Andrei, et al.
Publicado: (2026)
por: Pavelescu, Andrei, et al.
Publicado: (2026)
Three results towards the approximation of special maximum matchings in graphs
por: Mkrtchyan, Vahan
Publicado: (2024)
por: Mkrtchyan, Vahan
Publicado: (2024)
Algorithmic releases on the spanning trees of suitable graphs
por: Imbesi, Maurizio, et al.
Publicado: (2017)
por: Imbesi, Maurizio, et al.
Publicado: (2017)
Proper conflict-free degree-choosability of outerplanar graphs
por: Kashima, Masaki, et al.
Publicado: (2025)
por: Kashima, Masaki, et al.
Publicado: (2025)
Metric dimension of maximal outerplanar graphs
por: Claverol, Mercè, et al.
Publicado: (2019)
por: Claverol, Mercè, et al.
Publicado: (2019)
Regularity and separation for Sierpiński products of graphs
por: Maffucci, Riccardo W.
Publicado: (2025)
por: Maffucci, Riccardo W.
Publicado: (2025)
Minimal obstructions to $C_5$-coloring in hereditary graph classes
por: Goedgebeur, Jan, et al.
Publicado: (2024)
por: Goedgebeur, Jan, et al.
Publicado: (2024)
5-Coloring Planar Graphs with a Color Class of Order at Most $|V|/6$
por: Inoue, Yuta, et al.
Publicado: (2025)
por: Inoue, Yuta, et al.
Publicado: (2025)
Common neighbours in planar graphs
por: Maffucci, Riccardo W.
Publicado: (2025)
por: Maffucci, Riccardo W.
Publicado: (2025)
Genetic algorithm and edge-colorings of complete graphs with connected classes
por: Cervantes-Ojeda, Jorge, et al.
Publicado: (2024)
por: Cervantes-Ojeda, Jorge, et al.
Publicado: (2024)
Intrinsically knotted graphs and connected domination
por: Li, Gregory, et al.
Publicado: (2024)
por: Li, Gregory, et al.
Publicado: (2024)
Infinite families of planar graphs of a given injective chromatic number
por: Daneels, Matias, et al.
Publicado: (2024)
por: Daneels, Matias, et al.
Publicado: (2024)
Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
por: Furmańczyk, Hanna, et al.
Publicado: (2020)
por: Furmańczyk, Hanna, et al.
Publicado: (2020)
A general lower bound for the domination number of cylindrical graphs
por: Carreño, José Juan, et al.
Publicado: (2018)
por: Carreño, José Juan, et al.
Publicado: (2018)
Quota Trees
por: White, Tad
Publicado: (2024)
por: White, Tad
Publicado: (2024)
Classification of polyhedral graphs by numbers of common neighbours
por: Maffucci, Riccardo W.
Publicado: (2025)
por: Maffucci, Riccardo W.
Publicado: (2025)
An NP-hardness result for the colored constrained maximum 2-edge-colorable subgraph problem in bipartite graphs
por: Mkrtchyan, Vahan
Publicado: (2024)
por: Mkrtchyan, Vahan
Publicado: (2024)
$5$-list-coloring toroidal $6$-regular triangulations in linear time
por: Balachandran, Niranjan, et al.
Publicado: (2021)
por: Balachandran, Niranjan, et al.
Publicado: (2021)
Large induced subgraph with a given pathwidth in outerplanar graphs
por: Matsumoto, Naoki, et al.
Publicado: (2025)
por: Matsumoto, Naoki, et al.
Publicado: (2025)
$2$-polarity and algorithmic aspects of polarity variants on cograph superclasses
por: Contreras-Mendoza, Fernando Esteban, et al.
Publicado: (2022)
por: Contreras-Mendoza, Fernando Esteban, et al.
Publicado: (2022)
A Linear Kernel for Independent Set Reconfiguration in Planar Graphs
por: Bousquet, Nicolas, et al.
Publicado: (2025)
por: Bousquet, Nicolas, et al.
Publicado: (2025)
Coloring graphs as complete graph invariants
por: Asgarli, Shamil, et al.
Publicado: (2025)
por: Asgarli, Shamil, et al.
Publicado: (2025)
Recognition of chordal graphs and cographs which are Cover-Incomparability graphs
por: Anil, Arun, et al.
Publicado: (2023)
por: Anil, Arun, et al.
Publicado: (2023)
Constructions stemming from non-separating planar graphs and their Colin de Verdière invariant
por: Pavelescu, Andrei, et al.
Publicado: (2021)
por: Pavelescu, Andrei, et al.
Publicado: (2021)
Local fractional metric dimension of rotationally symmetric planar graphs arisen from planar chorded cycles
por: Ali, Shahbaz, et al.
Publicado: (2021)
por: Ali, Shahbaz, et al.
Publicado: (2021)
$K_2$-Hamiltonian Graphs: II
por: Goedgebeur, Jan, et al.
Publicado: (2023)
por: Goedgebeur, Jan, et al.
Publicado: (2023)
Explicit geometric construction of Ramsey graphs
por: Kocbek, Matija
Publicado: (2025)
por: Kocbek, Matija
Publicado: (2025)
A dual view of Roman Domination: The 2-limited packing problem
por: Bachtler, Oliver, et al.
Publicado: (2026)
por: Bachtler, Oliver, et al.
Publicado: (2026)
Regular bipartite decompositions of pseudorandom graphs
por: Ferber, Asaf, et al.
Publicado: (2024)
por: Ferber, Asaf, et al.
Publicado: (2024)
Ejemplares similares
-
An algorithm for estimating the crossing number of dense graphs, and continuous analogs of the crossing and rectilinear crossing numbers
por: Solé-Pi, Oriol
Publicado: (2024) -
Burning numbers via eigenpolytopes -- Hamming graphs, Johnson graphs, and halved cubes
por: Tanaka, Hajime, et al.
Publicado: (2025) -
Computing the forcing spectrum of outerplanar graphs in polynomial time
por: Gorsky, Maximilian, et al.
Publicado: (2024) -
The zero blocking numbers of generalized Kneser graphs and generalized Johnson graphs
por: Lin, Hau-Yi, et al.
Publicado: (2025) -
B-colorings of planar and outerplanar graphs
por: Martin, Ryan R., et al.
Publicado: (2024)