The edge intersection graphs of paths in a tree
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3884202 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3910416 (Why is no real title available?)
- scientific article; zbMATH DE number 3757213 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3777537 (Why is no real title available?)
- scientific article; zbMATH DE number 3639680 (Why is no real title available?)
- A Theorem on Coloring the Lines of a Network
- A recognition algorithm for the intersection graphs of paths in trees
- An Efficient Algorithm for Colouring the Edges of a Graph With Δ + 1 Colours
- Coloring a Family of Circular Arcs
- Critical perfect graphs and perfect 3-chromatic graphs
- Decomposition by clique separators
- Edge and vertex intersection of paths in a tree
- Information storage and retrieval - mathematical foundations. II: Combinatorial problems
- Intersection representations of graphs by arcs
- Line perfect graphs
- Partition numbers for trees and ordered sets
- Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture
- The Strong Perfect Graph Conjecture for Planar Graphs
- The helly-type property of non-trivial intervals on a tree
- The strong perfect graph conjecture for toroidal graphs
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
- The validity of the strong perfect-graph conjecture for (K₄-e)-free graphs
Cited in
(77)- Characterization and recognition of generalized clique-Helly graphs
- Constant threshold intersection graphs of orthodox paths in trees
- On the strong \(p\)-Helly property
- Strong cliques and equistability of EPT graphs
- Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2
- Path multicoloring with fewer colors in spiders and caterpillars
- A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree
- Single bend paths on a grid have strong Helly number 4: errata atque emendationes ad ``Edge intersection graphs of single bend paths on a grid
- Subtree and substar intersection numbers
- Towards a comprehensive theory of conflict-tolerance graphs
- On the complexity of recognizing directed path families
- On the generalized Helly property of hypergraphs, cliques, and bicliques
- Edge intersection hypergraphs
- Helly and strong Helly numbers of B_k-EPG and B_k-VPG graphs
- Relationship among B₁-EPG, VPT and EPT graphs classes
- Edge intersection graphs of \(L\)-shaped paths in grids
- Edge and vertex intersection of paths in a graph
- Complexity aspects of generalized Helly hypergraphs
- The complexity of path coloring and call scheduling
- A refined analysis of online path coloring in trees
- scientific article; zbMATH DE number 5763164 (Why is no real title available?)
- Constraint satisfaction with counting quantifiers
- Intersection models of weakly chordal graphs
- A superclass of edge-path-tree graphs with few cliques
- Integrality properties of edge path tree families
- Edge and vertex intersection of paths in a tree
- Triangulated edge intersection graphs of paths in a tree
- Decomposition by clique separators
- On spectrum assignment in elastic optical tree-networks
- Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. II
- Clique coloring EPT graphs on bounded degree trees
- Short length Menger's theorem and reliable optical routing
- Graphs of edge-intersecting and non-splitting paths
- Coloring all directed paths in a symmetric tree, with an application to optical networks
- An order theoretic framework for overlapping clustering
- Colouring paths in directed symmetric trees with applications to WDM routing
- On \(k\)-bend and monotonic \(\ell\)-bend edge intersection graphs of paths on a grid
- On edge-sets of bicliques in graphs
- Strong pseudo transitivity and intersection graphs
- The undirected optical indices of trees
- Subpath acyclic digraphs
- Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid
- What Is between Chordal and Weakly Chordal Graphs?
- Equivalences and the complete hierarchy of intersection graphs of paths in a tree
- Inverse chromatic number problems in interval and permutation graphs
- Revisiting decomposition by clique separators
- Path problems in generalized stars, complete graphs, and brick wall graphs
- Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I
- On the hereditary (p,q)-Helly property of hypergraphs, cliques, and bicliques
- Fractional path coloring in bounded degree trees with applications
- Dyadic representations of graphs
- Recognizing Helly edge-path-tree graphs and their clique graphs
- Clique-coloring UE and UEH graphs
- Interval graphs and related topics
- Representing edge intersection graphs of paths on degree 4 trees
- Minimum multiplicity edge coloring via orientation
- Characterizations and clique coloring of edge intersection graphs on a triangular grid
- Parameterized complexity of path set packing
- On superperfection of edge intersection graphs of paths
- On neighborhood-Helly graphs
- Parameterized complexity of path set packing
- Subtree filament graphs are subtree overlap graphs
- Intersection graphs of vertex disjoint paths in a tree
- Intersection graphs of orthodox paths in trees
- Algorithmic aspects of intersection graphs and representation hypergraphs
- Helly EPT graphs on bounded degree trees: characterization and recognition
- The k-edge intersection graphs of paths in a tree
- Helly numbers of polyominoes
- Optimal pricing of capacitated networks
- Constant tolerance intersection graphs of subtrees of a tree
- Edge intersection graphs of single bend paths on a grid
- Inapproximability and approximability of minimal tree routing and coloring
- On non-superperfection of edge intersection graphs of paths
- Path multicoloring in spider graphs with even color multiplicity
- Path covering problems and testing of printed circuits
- Neighborhood subtree tolerance graphs
- Representations of graphs and networks (coding, layouts and embeddings)
This page was built for publication: The edge intersection graphs of paths in a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792348)
