summary:In this work, we get a combinatorial characterization for maximal generalized outerplanar graphs (mgo graphs). This result yields a recursive algorithm testing whether a graph is a mgo graph or not
Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighbo...
Abstract. Fan-planar graphs were recently introduced as a generalization of 1-planar graphs. A graph...
AbstractThose nonseparable graphs whose induced cycles form a (necessarily minimum length) cycle bas...
summary:In this work, we get a combinatorial characterization for maximal generalized outerplanar gr...
In this work, we get a combinatorial characterization for maximal generalized outerplanar graphs (m...
summary:We define the generalized outerplanar index of a graph and give a full characterization of g...
summary:We define the generalized outerplanar index of a graph and give a full characterization of g...
AbstractThe paper presents several characterizations of outerplanar graphs, some of them are counter...
AbstractLet G be a planar graph and W a set of vertices, G is W-outerplanar if it can be embedded in...
In this paper, we determine upper bounds on the algebraic connectivity, denoted as a(G), of maximal ...
A graph is a mathematical abstraction that is useful in solving a variety of problems. NP-complete (...
AbstractLet G be a planar graph and W a set of vertices, G is W-outerplanar if it can be embedded in...
An outerplanar graph is a graph which can be embedded in the plane so that all vertices lie on the b...
A graph is outer 1-planar (o1p) if it can be drawn in the plane such that all vertices are on the ou...
A graph is outer 1-planar (o1p) if it can be drawn in the plane such that all vertices are on the ou...
Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighbo...
Abstract. Fan-planar graphs were recently introduced as a generalization of 1-planar graphs. A graph...
AbstractThose nonseparable graphs whose induced cycles form a (necessarily minimum length) cycle bas...
summary:In this work, we get a combinatorial characterization for maximal generalized outerplanar gr...
In this work, we get a combinatorial characterization for maximal generalized outerplanar graphs (m...
summary:We define the generalized outerplanar index of a graph and give a full characterization of g...
summary:We define the generalized outerplanar index of a graph and give a full characterization of g...
AbstractThe paper presents several characterizations of outerplanar graphs, some of them are counter...
AbstractLet G be a planar graph and W a set of vertices, G is W-outerplanar if it can be embedded in...
In this paper, we determine upper bounds on the algebraic connectivity, denoted as a(G), of maximal ...
A graph is a mathematical abstraction that is useful in solving a variety of problems. NP-complete (...
AbstractLet G be a planar graph and W a set of vertices, G is W-outerplanar if it can be embedded in...
An outerplanar graph is a graph which can be embedded in the plane so that all vertices lie on the b...
A graph is outer 1-planar (o1p) if it can be drawn in the plane such that all vertices are on the ou...
A graph is outer 1-planar (o1p) if it can be drawn in the plane such that all vertices are on the ou...
Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighbo...
Abstract. Fan-planar graphs were recently introduced as a generalization of 1-planar graphs. A graph...
AbstractThose nonseparable graphs whose induced cycles form a (necessarily minimum length) cycle bas...
DOI
Add to ORKG