The edge inducibility of graphs
From MaRDI portal
Publication:3910550
Cites work
Cited in
(20)- Achromatic number is NP-complete for cographs and interval graphs
- A simple linear time algorithm for the domatic partition problem on strongly chordal graphs
- A setup heuristic for interval orders
- The inducibility of complete bipartite graphs
- New sequential and parallel algorithms for interval graph recognition
- The complexity of facets (and some facets of complexity)
- Weighted parameters in \((P_5,\overline {P_5})\)-free graphs
- A new approach for the domination problem on permutation graphs
- Counting clique trees and computing perfect elimination schemes in parallel
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs
- Extreme chordal doubly nonnegative matrices with given row sums
- The Hamiltonian circuit problem for circle graphs is NP-complete
- Solving the single step graph searching problem by solving the maximum two-independent set problem
- An efficient parallel algorithm for scheduling interval ordered tasks
- The edge inducibility of graphs
- The domatic number problem on some perfect graph families
- Object-oriented interaction in resource constrained scheduling
- A Helly theorem for convexity in 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)
