Results 191 to 200 of about 1,939,159 (235)
Some of the next articles are maybe not open access.
Graphs and Combinatorics, 1994
``For integers \(k \geq 2\), the \(k\)-line graph of a graph \(G\) is defined as a graph whose vertices correspond to the complete subgraphs on \(k\) vertices in \(G\) with two distinct vertices adjacent if the corresponding complete subgraphs have \(k-1\) common vertices in \(G\).'' Starting with a graph \(G\), one can construct the sequence of graphs
Le Van Bang, Prisner, Erich
openaire +2 more sources
``For integers \(k \geq 2\), the \(k\)-line graph of a graph \(G\) is defined as a graph whose vertices correspond to the complete subgraphs on \(k\) vertices in \(G\) with two distinct vertices adjacent if the corresponding complete subgraphs have \(k-1\) common vertices in \(G\).'' Starting with a graph \(G\), one can construct the sequence of graphs
Le Van Bang, Prisner, Erich
openaire +2 more sources
Graphs and Combinatorics, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Niu, Zhaohong, Xiong, Liming
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Niu, Zhaohong, Xiong, Liming
openaire +2 more sources
2021
Signed graphs are another interesting variation of graphs, usually taken to be graphs in which each edge is either positive or negative. In the literature, there is more than one option for the rule for the labels on the edges of the line graph, and two of these will be considered here.
Lowell W. Beineke, Jay S. Bagga
openaire +1 more source
Signed graphs are another interesting variation of graphs, usually taken to be graphs in which each edge is either positive or negative. In the literature, there is more than one option for the rule for the labels on the edges of the line graph, and two of these will be considered here.
Lowell W. Beineke, Jay S. Bagga
openaire +1 more source
Uniquely Line Colorable Graphs
Canadian Mathematical Bulletin, 1973A line-coloring of a graph G is an assignment of colors to the lines of G so that adjacent lines are colored differently; an n-line coloring uses n colors. The line-chromatic number χ'(G) is the smallest n for which G admits an n-line coloring.
Greenwell, D. L., Kronk, H. V.
openaire +2 more sources
Collapsible Graphs and Hamiltonicity of Line Graphs
Graphs and Combinatorics, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yang, Weihua +3 more
openaire +3 more sources
Discrete Mathematics, 2022
A connected graph is said to be supereulerian if it containes a spanning Eulerian subgraph. The interest in these graphs comes from the fact that such a graph has a Hamiltonian line graph. A graph \(G\) is called essentially \(k\)-edge connected if \(G\) does not have an essential edge cut \(X\) with \(|X| < k.\) The main results of this paper ...
Shangguan, Yingmin, Xiong, Liming
openaire +1 more source
A connected graph is said to be supereulerian if it containes a spanning Eulerian subgraph. The interest in these graphs comes from the fact that such a graph has a Hamiltonian line graph. A graph \(G\) is called essentially \(k\)-edge connected if \(G\) does not have an essential edge cut \(X\) with \(|X| < k.\) The main results of this paper ...
Shangguan, Yingmin, Xiong, Liming
openaire +1 more source
Neighbourhood-Perfect Line Graphs
Graphs and Combinatorics, 1994zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Acta Mathematica Scientia, 1998
For a graph \(G\), let \(\overline {\sigma}_2\) denote min\(\{ d(u) + d(v)\mid uv \in E(G) \}\). The author shows that if \(G\) is connected and of order \(n \geq 43\) such that the line graph \(L(G)\) is Hamiltonian and \(\overline {\sigma}_2> 2(n/5 - 1)\), then \(L(G)\) is pancyclic. This settles a conjecture of Benhocine et al. For a connected graph
openaire +2 more sources
For a graph \(G\), let \(\overline {\sigma}_2\) denote min\(\{ d(u) + d(v)\mid uv \in E(G) \}\). The author shows that if \(G\) is connected and of order \(n \geq 43\) such that the line graph \(L(G)\) is Hamiltonian and \(\overline {\sigma}_2> 2(n/5 - 1)\), then \(L(G)\) is pancyclic. This settles a conjecture of Benhocine et al. For a connected graph
openaire +2 more sources
Journal of Graph Theory, 1984
AbstractWe give best possible Ore‐like conditions for a graph so that its line graph is Hamiltonian.
openaire +2 more sources
AbstractWe give best possible Ore‐like conditions for a graph so that its line graph is Hamiltonian.
openaire +2 more sources
Proceedings of the working conference on Advanced visual interfaces - AVI '06, 2006
Scientific measurements are often depicted as line graphs. State-of-the-art high throughput systems in life sciences, telemetry and electronics measurement rapidly generate hundreds to thousands of such graphs. Despite the increasing volume and ubiquity of such data, few software systems provide efficient interactive management, navigation and ...
Robert Kincaid, Heidi Lam
openaire +1 more source
Scientific measurements are often depicted as line graphs. State-of-the-art high throughput systems in life sciences, telemetry and electronics measurement rapidly generate hundreds to thousands of such graphs. Despite the increasing volume and ubiquity of such data, few software systems provide efficient interactive management, navigation and ...
Robert Kincaid, Heidi Lam
openaire +1 more source