Pages that link to "Item:Q3652563"

The following pages link to Characterizing path graphs by forbidden induced subgraphs (Q3652563):

Displaying 23 items.

• End simplicial vertices in path graphs (Q274693) (← links)
• On models of directed path graphs non rooted directed path graphs (Q292267) (← links)
• Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I (Q323036) (← links)
• Graph isomorphism for graph classes characterized by two forbidden induced subgraphs (Q344864) (← links)
• A characterization of substar graphs (Q401150) (← links)
• Reduced clique graphs of chordal graphs (Q412263) (← links)
• Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs (Q468443) (← links)
• On paths avoding forbidden pairs of vertices in a graph (Q678872) (← links)
• Asteroidal quadruples in non rooted path graphs (Q891307) (← links)
• The forbidden subgraph characterization of directed vertex graphs (Q1297413) (← links)
• A forbidden subgraph characterization of some graph classes using betweenness axioms (Q1946665) (← links)
• The vertex leafage of chordal graphs (Q2442202) (← links)
• Intersection graphs of short paths in a tree (Q2765167) (← links)
• Asteroids in rooted and directed path graphs (Q2839213) (← links)
• On some simplicial elimination schemes for chordal graphs (Q2839220) (← links)
• Contraction Blockers for Graphs with Forbidden Induced Paths (Q2947020) (← links)
• From Path Graphs to Directed Path Graphs (Q3057630) (← links)
• Characterizing directed path graphs by forbidden asteroids (Q3174239) (← links)
• Intersection graphs of non-crossing paths (Q6041577) (← links)
• Two new characterizations of path graphs (Q6056699) (← links)
• (Q6134963) (← links)
• Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs (Q6599055) (← links)
• Exactly hittable interval graphs (Q6599815) (← links)