Results 71 to 80 of about 162 (144)
Discussiones Mathematicae Graph Theory, 2018 Let 𝒫 be an arbitrary class of graphs that is closed under taking induced subgraphs and let 𝒞 (𝒫) be the family of forbidden subgraphs for 𝒫. We investigate the class 𝒫 (k) consisting of all the graphs G for which the removal of no more than k vertices ...
Borowiecki Mieczysław +2 more
doaj +1 more source
Non-Preemptive Tree Packing. [PDF]
Algorithmica, 2023 Lendl S, Woeginger G, Wulf L.
europepmc +1 more source
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
Rainbow subgraphs in edge-colored planar and outerplanar graphs [PDF]
Discrete Mathematics Letters, 2023 Július Czap
doaj +1 more source
On reconstructing maximal outerplanar graphs
Discrete Mathematics, 1974 Manvel has proved that a maximal outerplanar graph can be reconstructed from the collection of isomorphism types of subgraphs obtained by deleting vertices of the given graph. This paper sharpens Manvel's result by showing that if the graph is not a triangulation of a hexagon, then reconstruction can be accomplished using only those isomorphism types ...
openaire +1 more source
Horizontal visibility graph of a random restricted growth sequence. [PDF]
Adv Appl Math, 2021 Mansour T, Rastegar R, Roitershtein A.
europepmc +1 more source
Reconstruction of maximal outerplanar graphs
Discrete Mathematics, 1972 AbstractS. Ulam has conjectured that every graph with three or more points is uniquely determined by its collection of point-deleted subgraphs. This has been proved for various classes of graphs, but progress has generally been confined to very symmetrical graphs and graphs with connectivity zero or one.
openaire +2 more sources
A note on compact and compact circular edge-colorings of graphs
Discrete Mathematics & Theoretical Computer Science, 2008 In the paper we study two variants of edge-coloring of edge-weighted graphs, namely compact edge-coloring and circular compact edge-coloring. First, we discuss relations between these two coloring models.
Dariusz Dereniowski, Adam Nadolski
doaj
An Exact Algorithm for Counting the Number of Independent Sets of a Graph
MathematicsFor a graph G of a degree greater than or equal to 3, counting the number of independent sets (denoted as i(G)) is a classical #P-complete problem. Here, we establish a new worst-case upper bound time complexity for computing i(G) for any non-constraint ...
Guillermo De Ita Luna +3 more
doaj +1 more source