The \(\langle t \rangle \)-property of some classes of graphs

DOI10.1016/j.disc.2007.12.057zbMath1200.05191OpenAlexW2019046824MaRDI QIDQ998518

S. Aparna Lakshmanan, Ambat 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

zbMATH Keywords

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

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items (4)

Clique-transversal sets and clique-coloring in planar graphs ⋮ Claw-free cubic graphs with clique-transversal number half of their order ⋮ Linear time algorithm for dominator chromatic number of trestled graphs ⋮ OPEN PACKING NUMBER FOR SOME CLASSES OF PERFECT GRAPHS

Cites Work

• The strong perfect graph theorem
• Covering all cliques of a graph
• Covering the cliques of a graph with vertices
• On the clique-transversal number of chordal graphs
• On clique-transversals and clique-independent sets
• Algorithmic graph theory and perfect graphs
• Algorithmic aspects of clique-transversal and clique-independent sets
• A Linear Recognition Algorithm for Cographs
• The Private Neighbor Cube
• Unnamed Item

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