Results 71 to 80 of about 3,632 (158)
On λ-coloring split, chordal bipartite and weakly chordal graphs
Electronic Notes in Discrete Mathematics, 2009 Abstract A λ-coloring, or L(2, 1)-coloring, of a graph is an assignment of nonnegative integers to its vertices such that adjacent vertices get numbers at least two apart, and vertices at distance two get distinct numbers. Given a graph G, λ ( G ) is the minimum range of colors for which there exists a λ-coloring of G. A conjecture by Griggs
Márcia R. Cerioli, Daniel F.D. Posner
openaire +1 more source
Polyhedra without cubic vertices are prism‐hamiltonian
Journal of Graph Theory, Volume 106, Issue 2, Page 380-406, June 2024.Abstract The prism over a graph G $G$ is the Cartesian product of G $G$ with the complete graph on two vertices. A graph G $G$ is prism‐hamiltonian if the prism over G $G$ is hamiltonian. We prove that every polyhedral graph (i.e., 3‐connected planar graph) of minimum degree at least four is prism‐hamiltonian.
Simon Špacapan
wiley +1 more source
On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs
Discrete Applied Mathematics, 2012 An \(L(2,1)\) coloring of a graph \(G=(V,E)\) is a mapping \(c:V\rightarrow \{0,1,\dots,k\}\) such that \(|c(u)-c(v)| \geq 2\) for any pair \(uv\) of adjacent vertices, and \(c(u) \neq c(v)\) if \(u\) and \(v\) are at a distance 2. Let \(\lambda\) be the smallest number \(k\) for which there exists an \(L(2,1)\) coloring of \(G\). \textit{J.R.
Cerioli, Márcia R., Posner, Daniel F.D.
openaire +2 more sources
On factorial properties of chordal bipartite graphs
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dabrowski, Konrad +2 more
openaire +2 more sources
On a class of column‐weight 3 decomposable LDPC codes with the analysis of elementary trapping sets
IET Communications, Volume 18, Issue 9, Page 583-596, June 2024.In this paper, some variations of edge coloring of graphs are used to construct some column‐weight‐three decomposable LDPC codes with girths at least six and eight. Applying the presented method on several known classes of bipartite graphs, some classes of column‐weight‐three decomposable LDPC codes are derived having flexibility in length and rate ...
G. Raeisi, M. Gholami
wiley +1 more source
Classes of intersection digraphs with good algorithmic properties
Journal of Graph Theory, Volume 106, Issue 1, Page 110-148, May 2024.Abstract While intersection graphs play a central role in the algorithmic analysis of hard problems on undirected graphs, the role of intersection digraphs in algorithms is much less understood. We present several contributions towards a better understanding of the algorithmic treatment of intersection digraphs.
Lars Jaffke +2 more
wiley +1 more source
Efficient Algorithm for Checking 2-Chordal (Doubly Chordal) Bipartite Graphs
, 2021 10 ...
openaire +2 more sources
Geodeticity of the contour of chordal bipartite graphs
Electronic Notes in Discrete Mathematics, 2015 Abstract A vertex of a connected graph is a contour vertex provided the eccentricity of the vertex is at least as large as that of each of its neighbors. We consider the question of whether the set S of contour vertices of a connected graph is geodetic, i.e., whether every vertex of the graph lies on a shortest path (geodesic) between some pair of ...
D. Artigas, R. Sritharan
openaire +1 more source
Classes of bipartite graphs related to chordal graphs
Discrete Applied Mathematics, 1991 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Enumerating minimal dominating sets in chordal bipartite graphs
Discrete Applied Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Golovach, Petr A. +4 more
openaire +1 more source