-degree closures for graphs

DOI10.1016/J.DISC.2011.09.033MaRDI QIDQ658065zbMATHOpenAlexFDO

Authors Ahmed Ainouche

Publication date 11 January 2012

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2011.09.033

zbMATH Keywords

degree sequencematching numbercyclabilityHamiltonicity\(k\)-leaf-connecteddual closureneighborhood closure

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• \(\beta \)-degree closures for graphs
• More powerful closure operations on graphs
• Computation of the 0-dual closure for hamiltonian graphs
• Subgraphs, closures and hamiltonicity
• Extension of several sufficient conditions for Hamiltonian graphs

Cites work

• scientific article; zbMATH DE number 863469 (Why is no real title available?)
• A closure concept based on neighborhood unions of independent triples
• A method in graph theory
• Graph theory
• Note on Hamilton Circuits
• Semi-independence number of a graph and the existence of Hamiltonian circuits
• Some Theorems on Abstract Graphs
• Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs
• \(\beta \)-degree closures for graphs
• \(\beta\)-neighborhood closures for graphs

Cited in

(10)

• \(\beta \)-degree closures for graphs
• Computation of the 0-dual closure for hamiltonian graphs
• scientific article; zbMATH DE number 5944619 (Why is no real title available?)
• Extension of several sufficient conditions for Hamiltonian graphs
• Subgraphs, closures and hamiltonicity
• A note on the computation on the k-closure of a graph
• A formal context for closures of acyclic hypergraphs
• \(\beta\)-neighborhood closures for graphs
• 0-dual closures for several classes of graphs
• Edge closures of Hamiltonian type

This page was built for publication: \(\alpha\)-degree closures for graphs

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