Results 111 to 120 of about 2,073 (195)

Non-Preemptive Tree Packing. [PDF]

Algorithmica, 2023
Lendl S, Woeginger G, Wulf L.
europepmc   +1 more source

A Survey of Maximal k-Degenerate Graphs and k-Trees

Theory and Applications of Graphs
This article surveys results on maximal $k$-degenerate graphs, $k$-trees, and related classes including simple $k$-trees, $k$-paths, maximal outerplanar graphs, and Apollonian networks.
Allan Bickle
doaj   +1 more source

Triangle-Free Outerplanar 3-Graphs are Pairwise Compatibility Graphs

Journal of Graph Algorithms and Applications, 2013
A graph G = (V,E) is called a pairwise compatibility graph (PCG) if there exists an edge-weighted tree T and two non-negative real numbers dmin and dmax such that each vertex u′ ∈ V corresponds to a leaf u of T and there is an edge (u′, v′) ∈ E if and
Sammi Abida Salma, Md. Saidur Rahman, Md. Iqbal Hossain   +2 more
doaj   +1 more source

Star coloring of outerplanar bipartite graphs [PDF]

, 2015
In this thesis, we investigate a coloring problem on a special class of graphs. A proper coloring of a graph is a coloring of the vertices of the graph so that vertices joined by an edge get different colors.
Gina Sanders
core  

Mitochondrial networks through the lens of mathematics. [PDF]

Phys Biol, 2023
Lewis GR, Marshall WF.
europepmc   +1 more source

The complexity of frugal colouring. [PDF]

Arab J Math, 2021
Bard S, MacGillivray G, Redlin S.
europepmc   +1 more source

The Tutte polynomial characterizes simple outerplanar graphs

We show that if G is a simple outerplanar graph and H is a graph with the same Tutte polynomial as G, then H is also outerplanar.
Noble, S., Goodall, Andrew, Noy Serrano, Marcos, Mier Vinué, Anna de   +3 more
core  

The role of twins in computing planar supports of hypergraphs

Journal of Graph Algorithms and Applications
A support or realization of a hypergraph $\mathcal{H}$ is a graph \(G\) on the same vertex set as \(\mathcal{H}\) such that for each hyperedge of $\mathcal{H}$ it holds that its vertices induce a connected subgraph of $G$.
René van Bevern, Iyad Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge   +4 more
doaj   +1 more source

On Colorings of Squares of Outerplanar Graphs

, 2007
24 pages, 17 ...
Geir Agnarsson, Magnús M. Halldórsson
openaire   +3 more sources

On the k-Structure Ratio in Planar and Outerplanar Graphs

Discrete Mathematics & Theoretical Computer Science, 2008
A planar k-restricted structure is a simple graph whose blocks are planar and each has at most k vertices. Planar k-restricted structures are used by approximation algorithms for Maximum Weight Planar Subgraph, which motivates this work. The planar k-
Gruia Calinescu, Cristina G. Fernandes
doaj