Some consideration about component minimal complete subgraph

MaRDI QIDQ4619905zbMATH OpenFDO

Authors Silviu Barza

Publication date 7 February 2019

zbMATH Keywords

complete graphssubgraphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Enumeration in graph theory (05C30) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• Sets approach algorithms for determination of component minimal complete subgraph
• A better sets approach algorithm for the determination of component minimal complete subgraph
• Some considerations about component p-vertexes complete subgraph
• Long cycles in subgraphs with prescribed minimum degree
• Subgraphs of minimal degree \(k\)

Cited in

(4)

• A better sets approach algorithm for the determination of component minimal complete subgraph
• 0-1 algebraic approach algorithm for the determination of component minimal complete subgraph
• Sets approach algorithms for determination of component minimal complete subgraph
• Some considerations about component p-vertexes complete subgraph

This page was built for publication: Some consideration about component minimal complete subgraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4619905)