The edge inducibility of graphs
From MaRDI portal
Publication:3910550
DOI10.1007/BF01886309zbMATH Open0461.05037OpenAlexW2025468003MaRDI QIDQ3910550FDOQ3910550
Authors: Yehoshua Perl, Martin Charles Golumbic 
Publication date: 1980
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01886309
Cites Work
Cited In (20)
- The domatic number problem on some perfect graph families
- Achromatic number is NP-complete for cographs and interval graphs
- Object-oriented interaction in resource constrained scheduling
- The inducibility of complete bipartite graphs
- A Helly theorem for convexity in graphs
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- Extreme chordal doubly nonnegative matrices with given row sums
- The edge inducibility of graphs
- The complexity of facets (and some facets of complexity)
- A new approach for the domination problem on permutation graphs
- A simple linear time algorithm for the domatic partition problem on strongly chordal graphs
- New sequential and parallel algorithms for interval graph recognition
- A setup heuristic for interval orders
- An efficient parallel algorithm for scheduling interval ordered tasks
- Counting clique trees and computing perfect elimination schemes in parallel
- Solving the single step graph searching problem by solving the maximum two-independent set problem
- Weighted parameters in \((P_5,\overline {P_5})\)-free graphs
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs
- The Hamiltonian circuit problem for circle graphs is NP-complete
- A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs
This page was built for publication: The edge inducibility of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3910550)
