Pages that link to "Item:Q4823301"
From MaRDI portal
The following pages link to Hamilton cycles in split graphs with large minimum degree (Q4823301):
Displaying 10 items.
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
- A constant factor approximation algorithm for boxicity of circular arc graphs (Q741528) (← links)
- Dominating sets and domatic number of circular arc graphs (Q1066921) (← links)
- A linear algorithm for finding a minimum dominating set in a cactus (Q1078205) (← links)
- An optimal algorithm for finding dominating cycles in circular-arc graphs (Q1186160) (← links)
- A linear-time algorithm for paired-domination on circular-arc graphs (Q2354407) (← links)
- Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561) (← links)
- Connected Domination (Q3384607) (← links)
- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs (Q3512472) (← links)
- Linear separation of connected dominating sets in graphs (Q5225055) (← links)