The t -property of some classes of graphs

DOI10.1016/J.DISC.2007.12.057zbMATH Open1200.05191OpenAlexW2019046824MaRDI QIDQ998518FDOQ998518

Authors: S. Lakshmanan, A. Vijayakumar 

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.057

Recommendations

• \(t\)-perfection is always strong for claw-free graphs
• Claw-free \(t\)-perfect graphs can be recognized in polynomial time
• The Graphs with All Subgraphs T-Perfect
• On claw-free \(t\)-perfect graphs
• Characterising claw-free \(t\)-perfect graphs

zbMATH Keywords

\(\langle t\rangle \)-propertyclique transversal number

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Cites Work

• Covering all cliques of a graph
• Algorithmic graph theory and perfect graphs
• The strong perfect graph theorem
• A Linear Recognition Algorithm for Cographs
• Covering the cliques of a graph with vertices
• On clique-transversals and clique-independent sets
• Algorithmic aspects of clique-transversal and clique-independent sets
• On the clique-transversal number of chordal graphs
• The Private Neighbor Cube
• Title not available (Why is that?)

Cited In (8)

• Claw-free cubic graphs with clique-transversal number half of their order
• Title not available (Why is that?)
• Clique-transversal sets and clique-coloring in planar graphs
• Linear time algorithm for dominator chromatic number of trestled graphs
• Title not available (Why is that?)
• OPEN PACKING NUMBER FOR SOME CLASSES OF PERFECT GRAPHS
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: The \(\langle t \rangle \)-property of some classes of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998518)