Pages that link to "Item:Q1962038"

The following pages link to Domination and total domination on asteroidal triple-free graphs (Q1962038):

Displaying 29 items.

• Vertex ranking of asteroidal triple-free graphs (Q293448) (← links)
• A complexity dichotomy and a new boundary class for the dominating set problem (Q328713) (← links)
• Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs (Q477326) (← links)
• On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size (Q499360) (← links)
• On conditional covering problem (Q626967) (← links)
• A linear time algorithm to compute a dominating path in an AT-free graph (Q673002) (← links)
• Semitotal domination on AT-free graphs and circle graphs (Q831692) (← links)
• Matching properties in total domination vertex critical graphs (Q968225) (← links)
• A survey of selected recent results on total domination in graphs (Q998491) (← links)
• Efficient algorithms for Roman domination on some classes of graphs (Q1003729) (← links)
• A generalization of AT-free graphs and a generic algorithm for solving triangulation problems (Q1348907) (← links)
• Algorithms for graphs with small octopus (Q1421464) (← links)
• On claw-free asteroidal triple-free graphs (Q1613398) (← links)
• Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
• Induced disjoint paths in AT-free graphs (Q2051862) (← links)
• Complexity of paired domination in AT-free and planar graphs (Q2166758) (← links)
• Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
• On the minimum eccentricity shortest path problem (Q2404081) (← links)
• On the structure of graphs with bounded asteroidal number (Q2741345) (← links)
• Edge-dominating trails in AT-free graphs (extended abstract) (Q2741346) (← links)
• On the Minimum Eccentricity Shortest Path Problem (Q3449826) (← links)
• Independent sets in asteroidal triple-free graphs (Q4572004) (← links)
• Connected domination and steiner set on asteroidal triple-free graphs (Q5060107) (← links)
• (Q5071562) (← links)
• Domination problems on P₅-free graphs (Q5248877) (← links)
• On the structure of graphs with bounded asteroidal number (Q5943049) (← links)
• The diameter of AT‐free graphs (Q6057658) (← links)
• Asteroidal sets and dominating paths (Q6606182) (← links)
• Connected feedback vertex set on AT-free graphs (Q6658085) (← links)