scientific article; zbMATH DE number 3873365
From MaRDI portal
Publication:3340887
[For the entire collection see Zbl 0534.00005.] Le graphe C(G) des cycles d'un graphe G a pour sommets les cycles sans corde de G, deux sommets de C(G) étant adjacents si et seulement si les cycles correspondants de G ont au moins une arête commune. Un graphe G est dit cycle-évanescent (cycle-vanishing) s'il existe n tel que \(C^ n(G)\) est sans cycles. L'A. donne une caractérisation des graphes cycle-évanescents et montre que \(C^ 3(G)\) est sans cycle si G est cycle-évanescent.
Recommendations
Cited in
(10)- On inverse problems for the cycle graph operator
- Some notes on cycle graphs
- Cycle orders
- Cycle indicators and special functions
- Characterization of Cycle Stochastic Graphs
- scientific article; zbMATH DE number 4097410 (Why is no real title available?)
- scientific article; zbMATH DE number 54781 (Why is no real title available?)
- scientific article; zbMATH DE number 6287622 (Why is no real title available?)
- On cycle graphs
- The edge-intersection graph of induced paths in a graph
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3340887)