Pages that link to "Item:Q792348"
From MaRDI portal
The following pages link to The edge intersection graphs of paths in a tree (Q792348):
Displaying 50 items.
- Strong cliques and equistability of EPT graphs (Q260014) (← links)
- Graphs of edge-intersecting and non-splitting paths (Q288788) (← links)
- Edge intersection graphs of \(L\)-shaped paths in grids (Q299080) (← links)
- Inverse chromatic number problems in interval and permutation graphs (Q319198) (← links)
- Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I (Q323036) (← links)
- On the hereditary \((p,q)\)-Helly property of hypergraphs, cliques, and bicliques (Q324846) (← links)
- On neighborhood-Helly graphs (Q344856) (← links)
- Helly numbers of polyominoes (Q367067) (← links)
- Short length Menger's theorem and reliable optical routing (Q557907) (← links)
- Subtree and substar intersection numbers (Q686262) (← links)
- Complexity aspects of generalized Helly hypergraphs (Q845662) (← links)
- Inapproximability and approximability of minimal tree routing and coloring (Q935848) (← links)
- On the complexity of recognizing directed path families (Q967290) (← links)
- Equivalences and the complete hierarchy of intersection graphs of paths in a tree (Q1003465) (← links)
- Intersection models of weakly chordal graphs (Q1026105) (← links)
- A superclass of edge-path-tree graphs with few cliques (Q1038105) (← links)
- Integrality properties of edge path tree families (Q1043594) (← links)
- Edge and vertex intersection of paths in a tree (Q1060226) (← links)
- Interval graphs and related topics (Q1060229) (← links)
- Triangulated edge intersection graphs of paths in a tree (Q1061147) (← links)
- Decomposition by clique separators (Q1062072) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- An order theoretic framework for overlapping clustering (Q1344610) (← links)
- Minimum multiplicity edge coloring via orientation (Q1671364) (← links)
- Path multicoloring in spider graphs with even color multiplicity (Q1705690) (← links)
- On spectrum assignment in elastic optical tree-networks (Q1730219) (← links)
- On edge-sets of bicliques in graphs (Q1759846) (← links)
- Towards a comprehensive theory of conflict-tolerance graphs (Q1759850) (← links)
- Constant tolerance intersection graphs of subtrees of a tree (Q1764901) (← links)
- Dyadic representations of graphs (Q1783614) (← links)
- Neighborhood subtree tolerance graphs (Q1801665) (← links)
- Path covering problems and testing of printed circuits (Q1900134) (← links)
- Intersection graphs of vertex disjoint paths in a tree (Q1903730) (← links)
- Subpath acyclic digraphs (Q1918551) (← links)
- On superperfection of edge intersection graphs of paths (Q2056890) (← links)
- Constant threshold intersection graphs of orthodox paths in trees (Q2184664) (← links)
- A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree (Q2185817) (← links)
- Recognizing Helly edge-path-tree graphs and their clique graphs (Q2275917) (← links)
- Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2 (Q2374177) (← links)
- Subtree filament graphs are subtree overlap graphs (Q2380028) (← links)
- Helly EPT graphs on bounded degree trees: characterization and recognition (Q2404370) (← links)
- Intersection graphs of orthodox paths in trees (Q2413157) (← links)
- Path multicoloring with fewer colors in spiders and caterpillars (Q2460919) (← links)
- Characterization and recognition of generalized clique-Helly graphs (Q2462382) (← links)
- The \(k\)-edge intersection graphs of paths in a tree (Q2473042) (← links)
- Representing edge intersection graphs of paths on degree 4 trees (Q2476278) (← links)
- On the strong \(p\)-Helly property (Q2482102) (← links)
- Path problems in generalized stars, complete graphs, and brick wall graphs (Q2489960) (← links)
- On the generalized Helly property of hypergraphs, cliques, and bicliques (Q2689646) (← links)
