On P₄-transversals of chordal graphs
From MaRDI portal
Recommendations
- On P₄-transversals of perfect graphs
- scientific article; zbMATH DE number 3867386
- On the determination problem for \(P_{4}\)-transformation of graphs
- On the clique-transversal number of chordal graphs
- Transversals in 4-uniform hypergraphs
- On the \(P_4\)-components of graphs
- Tetravalent \(s\)-transitive graphs of order \(4p\)
- Enumeration of \(P_4\)-free chordal graphs
- Tetravalent vertex-transitive graphs of order \(4p\)
- Tetravalent \(s\)-transitive graphs of order \(4p ^{2}\)
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- Complement reducible graphs
- Domination, independent domination, and duality in strongly chordal graphs
- On P₄-transversals of perfect graphs
- Polarity of chordal graphs
- The strong perfect graph theorem
- Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard
- \(P_4\)-colorings and \(P_4\)-bipartite graphs
Cited in
(7)- On the determination problem for \(P_{4}\)-transformation of graphs
- Vertex partitions of graphs into cographs and stars
- Stable-\(\Pi\) partitions of graphs
- Complexity of cycle transverse matching problems
- Some results on 4-transitive digraphs
- Partitions of graphs into cographs
- Transversals in 4-uniform hypergraphs
This page was built for publication: On \(P_4\)-transversals of chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998435)