-degree closures for graphs

DOI10.1016/J.DISC.2011.09.033zbMATH Open1238.05223OpenAlexW4205766169MaRDI QIDQ658065FDOQ658065

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (10)

• Computation of the 0-dual closure for hamiltonian graphs
• A note on the computation on the k-closure of a graph
• Title not available (Why is that?)
• Edge closures of Hamiltonian type
• Extension of several sufficient conditions for Hamiltonian graphs
• 0-dual closures for several classes of graphs
• \(\beta\)-neighborhood closures for graphs
• A formal context for closures of acyclic hypergraphs
• Subgraphs, closures and hamiltonicity
• \(\beta \)-degree closures for graphs

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)