A closer look at Hamiltonicity and domination through the lens of diameter and convexity
From MaRDI portal
Publication:6634506
DOI10.1007/S00236-024-00461-ZMaRDI QIDQ6634506
R. Mahendra Kumar, N. Sadagopan
Publication date: 7 November 2024
Published in: Acta Informatica (Search for Journal in Brave)
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs
- Dominating sets for split and bipartite graphs
- Finding Hamiltonian circuits in interval graphs
- Bipartite permutation graphs
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- Complement reducible graphs
- Hamiltonian circuits determining the order of chromosomes
- Domination in some subclasses of bipartite graphs
- Algorithmic graph theory and perfect graphs
- HAMILTONian circuits in chordal bipartite graphs
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
- Hamiltonian path in \(K_{1,t}\)-free split graphs -- a dichotomy
- FPT Algorithms for Domination in Biclique-Free Graphs
- A Survey of Network Reliability and Domination Theory
- Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
- Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
- Analytical approach to parallel repetition
- 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: A closer look at Hamiltonicity and domination through the lens of diameter and convexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6634506)
