scientific article; zbMATH DE number 3402664
From MaRDI portal
Publication:5668506
zbMath0255.05121MaRDI QIDQ5668506
Stephen T. Hedetniemi, Peter J. Slater
Publication date: 1972
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (28)
On the iterated edge-biclique operator ⋮ On basic chordal graphs and some of its subclasses ⋮ Clique dynamics of locally cyclic graphs with \(\delta \geq 6\) ⋮ Unnamed Item ⋮ Upper bounds for the rainbow connection numbers of line graphs ⋮ Clique‐convergence is undecidable for automatic graphs ⋮ On the edge‐biclique graph and the iterated edge‐biclique operator ⋮ Iterated Clique Graphs and Contractibility ⋮ Random Graphs, Retractions and Clique Graphs ⋮ Rainbow connections of graphs: a survey ⋮ Almost every graph is divergent under the biclique operator ⋮ Characterization of classical graph classes by weighted clique graphs ⋮ Contractibility and the clique graph operator ⋮ On clique convergence of graphs ⋮ Comparability graphs and a new matroid ⋮ On expansive graphs ⋮ Cube intersection concepts in median graphs ⋮ Maximal independent sets in caterpillar graphs ⋮ The clique operator on cographs and serial graphs ⋮ Clique divergent clockwork graphs and partial orders ⋮ Distances and diameters on iterated clique graphs ⋮ Clique divergent graphs with unbounded sequence of diameters ⋮ Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs ⋮ Characterizing flag graphs and incuced subgraphs of Cartesian product graphs ⋮ Clique graphs of time graphs ⋮ Clique graphs and Helly graphs ⋮ On Graphs Without Multicliqual Edges ⋮ A polynomial algorithm for constructing the clique graph of a line graph
This page was built for publication:
