Results 41 to 50 of about 29,342 (268)
Equitable Coloring of IC-Planar Graphs with Girth g ≥ 7
Axioms, 2023 An equitable k-coloring of a graph G is a proper vertex coloring such that the size of any two color classes differ at most 1. If there is an equitable k-coloring of G, then the graph G is said to be equitably k-colorable.
Danjun Huang, Xianxi Wu
doaj +1 more source
On Aligned Bar 1-Visibility Graphs
Journal of Graph Algorithms and Applications, 2017 A graph is called a bar 1-visibility graph if its vertices can be represented as horizontal segments, called bars, and each edge corresponds to a vertical line of sight which can traverse another bar.
Franz Brandenburg +2 more
doaj +1 more source
Planar and poly-arc Lombardi drawings
Journal of Computational Geometry, 2018 In Lombardi drawings of graphs, edges are represented as circular arcs and the edges incident on vertices have perfect angular resolution. It is known that not every planar graph has a planar Lombardi drawing.
Christian A. Duncan +5 more
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2023 DP-coloring is generalized via relaxed coloring and variable degeneracy in [P. Sittitrai and K. Nakprasit, Su cient conditions on planar graphs to have a relaxed DP-3-coloring, Graphs Combin. 35 (2019) 837–845], [K.M. Nakprasit and K.
Sribunhung Sarawute +3 more
doaj +1 more source
The Electronic Journal of Combinatorics, 2018 A nonplanar graph $G$ is called almost-planar if for every edge $e$ of $G$, at least one of $G\backslash e$ and $G/e$ is planar. In 1990, Gubser characterized 3-connected almost-planar graphs in his dissertation. However, his proof is so long that only a small portion of it was published.
Guoli Ding +2 more
openaire +3 more sources
On planar hypohamiltonian graphs
Journal of Graph Theory, 2010 Summary: We present a planar hypohamiltonian graph on 42 vertices and (as a corollary) a planar hypotraceable graph on 162 vertices, improving the bounds of Zamfirescu and Zamfirescu and show some other consequences. We also settle the open problem whether there exists a positive integer \(N\), such that for every integer \(n\geq N\) there exists a ...
Wiener, Gabor, Araya, Makoto
openaire +3 more sources
On certain prime cordial families of graphs
Journal of Taibah University for Science, 2020 Graph labelling is an important tool in modelling real life problems. In the present paper, different graph families are studied for prime cordial labelling.
Nazeran Idrees +3 more
doaj +1 more source
Quasipolynomiality of the Smallest Missing Induced Subgraph
Journal of Graph Algorithms and Applications, 2023 We study the problem of finding the smallest graph that does not occur as an induced subgraph of a given graph. This missing induced subgraph has at most logarithmic size and can be found by a brute-force search, in an $n$-vertex graph, in time $n^{O ...
David Eppstein +2 more
doaj +1 more source
Molecular Oncology, EarlyView.Tumour heterogeneity and clonal evolution of metastatic salivary gland cancer were evaluated in two patients with adenoid carcinoma and one patient with myoepithelial carcinoma. Radiology‐guided autopsy enabled multi‐region sampling (total samples n = 149), followed by whole‐genome sequencing and phylogenetic reconstruction (17 tumour samples, 4–7 per ...
Gerben Lassche +10 more
wiley +1 more source
Planarity Testing and Optimal Edge Insertion with Embedding Constraints
Journal of Graph Algorithms and Applications, 2008 The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-of-the-art planar drawing algorithms.
Carsten Gutwenger +2 more
doaj +1 more source