Graph extensions, edit number and regular graphs

DOI10.1016/J.DAM.2018.10.042zbMath1407.05135arXiv1803.02888OpenAlexW2962808887WikidataQ128880406 ScholiaQ128880406MaRDI QIDQ1732121

Ghurumuruhan Ganesan

Publication date: 22 March 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.02888

zbMATH Keywords

connected regular graphsedit number of graphsgraph extensions

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• A survey of graph edit distance
• Regular graphs containing a given graph
• Finding a \(\Delta\)-regular supergraph of minimum order
• A note on a theorem of Erdős and Gallai
• Fixed-parameter tractable distances to sparse graph classes
• A remark on the existence of finite graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• A Fast Matching Algorithm for Graph-Based Handwriting Recognition
• Existence of k-edge connected ordinary graphs with prescribed degrees

This page was built for publication: Graph extensions, edit number and regular graphs