On non-superperfection of edge intersection graphs of paths
DOI10.1016/j.disopt.2024.100857MaRDI QIDQ6670498
Annegret K. Wagler, H. L. M. Kerivin, Victoria Kaial
Publication date: 23 January 2025
Published in: Discrete Optimization (Search for Journal in Brave)
interval coloringedge intersection graph of pathsrouting and spectrum assignment problemsuperperfection
Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The edge intersection graphs of paths in a tree
- The strong perfect graph theorem
- Algorithmic graph theory and perfect graphs
- On superperfection of edge intersection graphs of paths
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- On the combinatorial structure of chromatic scheduling polytopes
- Edge intersection graphs of single bend paths on a grid
- Representation of a finite graph by a set of intervals on the real line
- On superperfect noncomparability graphs
- A generalization of max flow—min cut
- Design of Survivable Networks: A survey
- Transitiv orientierbare Graphen
This page was built for publication: On non-superperfection of edge intersection graphs of paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6670498)
