Results 231 to 240 of about 1,947,729 (286)
Some of the next articles are maybe not open access.
Acta Mathematicae Applicatae Sinica, English Series, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yang, Wei-ling +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yang, Wei-ling +2 more
openaire +1 more source
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