A combinatorial notion of null-homotopy for graphs was introduced by Duchet, Las Vergnas, and Meyniel. Their results were of a qualitative nature for all such graphs. Here some quantitative results are established for the special class of graphs which contain no isometric cycles other than triangles. It is also shown how each cycle in such a graph may be decomposed into chordal pieces
Abstract. This article investigates structural, geometrical, and topological characterizations and p...
AbstractWe study two new special families of complete subgraphs of a graph. For chordal graphs, one ...
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd h...
A combinatorial notion of null-homotopy for graphs was introduced by Duchet, Las Vergnas, and Meynie...
AbstractIn this note, we answer a problem of P. Duchet, M. Las Vergnas and H. Meyniel by giving an e...
AbstractWe investigate some properties of graohs whose cycle space has a basis constituted of triang...
AbstractThe nullity of a graph is defined as the multiplicity of the eigenvalue zero in the spectrum...
We prove that a connected graph whose cycle space is generated by its triangles and which is either ...
AbstractFor acyclic and unicyclic graphs we determine a necessary and sufficient condition for a gra...
Following a question of Anstee and Farber we investigate the possibility that all bridged graphs are...
AbstractWe classify all Cohen–Macaulay chordal graphs. In particular, it is shown that a chordal gra...
AbstractA subgraph H of a graph G is isometric if the distance between any pair of vertices in H is ...
AbstractJamison proved that every cycle of length greater than three in a graph has a chord—in other...
AbstractThe nullity of a graph G, denoted by η(G), is the multiplicity of the eigenvalue zero in its...
AbstractIn this paper, we introduce the class of chordal probe graphs which are a generalization of ...
Abstract. This article investigates structural, geometrical, and topological characterizations and p...
AbstractWe study two new special families of complete subgraphs of a graph. For chordal graphs, one ...
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd h...
A combinatorial notion of null-homotopy for graphs was introduced by Duchet, Las Vergnas, and Meynie...
AbstractIn this note, we answer a problem of P. Duchet, M. Las Vergnas and H. Meyniel by giving an e...
AbstractWe investigate some properties of graohs whose cycle space has a basis constituted of triang...
AbstractThe nullity of a graph is defined as the multiplicity of the eigenvalue zero in the spectrum...
We prove that a connected graph whose cycle space is generated by its triangles and which is either ...
AbstractFor acyclic and unicyclic graphs we determine a necessary and sufficient condition for a gra...
Following a question of Anstee and Farber we investigate the possibility that all bridged graphs are...
AbstractWe classify all Cohen–Macaulay chordal graphs. In particular, it is shown that a chordal gra...
AbstractA subgraph H of a graph G is isometric if the distance between any pair of vertices in H is ...
AbstractJamison proved that every cycle of length greater than three in a graph has a chord—in other...
AbstractThe nullity of a graph G, denoted by η(G), is the multiplicity of the eigenvalue zero in its...
AbstractIn this paper, we introduce the class of chordal probe graphs which are a generalization of ...
Abstract. This article investigates structural, geometrical, and topological characterizations and p...
AbstractWe study two new special families of complete subgraphs of a graph. For chordal graphs, one ...
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd h...
DOI
Add to ORKG