Results 51 to 60 of about 1,769 (162)
Toric ideals of matching polytopes and edge colorings
Mathematika, Volume 72, Issue 2, April 2026.Abstract In this paper, we investigate the maximal degree of minimal generators of the toric ideal of the matching polytope of a graph. It is known that the toric ideal associated with a bipartite graph is generated by binomials of degree at most 3.
Kenta Mori +3 more
wiley +1 more source
On Large Induced Outerplanar Subgraphs in $2$-Outerplanar Graphs
CoRRBorradaile, Le and Sherman-Bennett [Graphs and Combinatorics, 2017] proved that every $n$-vertex $2$-outerplane graph has a set of at least $2n/3$ vertices that induces an outerplane graph. We identify a major flaw in their proof and recover their result with a different, and unfortunately much more complex, proof.
Marco D'Elia, Fabrizio Frati
openaire +2 more sources
Outerplanar Graphs and Delaunay Triangulations [PDF]
, 2012 Dillencourt [1] showed that all maximal outerplanar graphs can be realized as Delaunay triangulations of points in convex position. In this note, we give two new, alternate proofs.
Alam, Ashraful +2 more
openaire +4 more sources
Double domination in maximal outerplanar graphs
Open Mathematics, 2022 In graph GG, a vertex dominates itself and its neighbors. A subset S⊆V(G)S\subseteq V\left(G) is said to be a double-dominating set of GG if SS dominates every vertex of GG at least twice.
Zhuang Wei, Zheng Qiuju
doaj +1 more source
Perfect Matching Under Precedence Constraints
Networks, Volume 87, Issue 2, Page 175-190, March 2026.ABSTRACT In this article, we motivate and define variants of perfect matching under precedence constraints where a perfect matching is built incrementally and precedence constraints ensure that an edge may only be added to the matching if the edge's predecessor vertices have already been covered.
Christina Büsing, Corinna Mathwieser
wiley +1 more source
Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems
Journal of Graph Algorithms and Applications, 2007 The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some new approximation algorithms for MIPS are introduced.
Kerri Morgan, Graham Farr
doaj +1 more source
Face Sizes and the Connectivity of the Dual
Journal of Graph Theory, Volume 110, Issue 4, Page 379-391, December 2025.ABSTRACT For each c ≥ 1, we prove tight lower bounds on face sizes that must be present to allow 1‐ or 2‐cuts in simple duals of c‐connected maps. Using these bounds, we determine the smallest genus on which a c‐connected map can have a simple dual with a 2‐cut and give lower and some upper bounds for the smallest genus on which a c‐connected map can ...
Gunnar Brinkmann +2 more
wiley +1 more source
On k-edge-magic labelings of maximal outerplanar graphs
AKCE International Journal of Graphs and Combinatorics, 2015 Let G be a graph with vertex set V and edge set E such that |V|=p and |E|=q. We denote this graph by (p,q)-graph. For integers k≥0, define a one-to-one map f from E to {k,k+1,…,k+q−1} and define the vertex sum for a vertex v as the sum of the labels of ...
Gee-Choon Lau +3 more
doaj +1 more source
Recognizing Trees From Incomplete Decks
Journal of Graph Theory, Volume 110, Issue 3, Page 322-336, November 2025.ABSTRACT Given a graph G, the unlabeled subgraphs G − v are called the cards of G. The deck of G is the multiset { G − v : v ∈ V ( G ) }. Wendy Myrvold showed that a disconnected graph and a connected graph both on n vertices have at most ⌊ n 2 ⌋ + 1 cards in common and found (infinite) families of trees and disconnected forests for which this upper ...
Gabriëlle Zwaneveld
wiley +1 more source
Monitoring maximal outerplanar graphs [PDF]
Electronic Notes in Discrete Mathematics, 2014 In this paper we define a new concept of monitoring the elements of triangulation graphs by faces. Furthermore, we analyze this, and other monitoring concepts (by vertices and by edges), from a combinatorial point of view, on maximal outerplanar graphs.
Gregorio Hernández-Peñalver +1 more
openaire +4 more sources