Impact of diameter and convex ordering for Hamiltonicity and domination

DOI10.1007/978-3-031-52213-0_14MaRDI QIDQ6547831

N. Sadagopan, R. Mahendra Kumar

Publication date: 31 May 2024

zbMATH Keywords

diameterdominationHamiltonian cycle (path)dichotomy resultsstar (bi-star) convex bipartite graphstar (comb) convex split graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs
• Feedback vertex sets on restricted bipartite graphs
• Bipartite permutation graphs
• Domination in some subclasses of bipartite graphs
• HAMILTONian circuits in chordal bipartite graphs
• Hamiltonian path in \(K_{1,t}\)-free split graphs -- a dichotomy
• FPT Algorithms for Domination in Biclique-Free Graphs
• Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
• On the complexity of the minimum outer-connected dominating set problem in graphs
• P versus NPC: minimum Steiner trees in convex split graphs
• Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy

This page was built for publication: Impact of diameter and convex ordering for Hamiltonicity and domination