Subgraph transversal of graphs

DOI10.1007/S00373-009-0850-ZMaRDI QIDQ844218zbMATH OpenOpenAlexFDO

Authors Jia Shen

Publication date 18 January 2010

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-009-0850-z

zbMATH Keywords

clique-transversalF-free subgraphhypergraphtransversal

Mathematics Subject Classification ID

Hypergraphs (05C65)

Recommendations

• scientific article; zbMATH DE number 3961651
• On the maximal number of certain subgraphs in \(K_ r\)-free graphs
• Transversal numbers of uniform hypergraphs
• Extremal problems for transversals in graphs with bounded degree
• Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs

Cites work

• Chains, antichains, and fibres
• Clique-transversal sets of line graphs and complements of line graphs
• Coloring the Maximal Cliques of Graphs
• Covering all cliques of a graph
• Covering the cliques of a graph with vertices
• Fibres and ordered set coloring
• scientific article; zbMATH DE number 3536154 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• Maximal Chains and Antichains in Boolean Lattices
• On chromatic number of graphs and set-systems

Cited in

(2)

• Extremal even-cycle-free subgraphs of the complete transposition graphs
• scientific article; zbMATH DE number 3961651 (Why is no real title available?)

This page was built for publication: Subgraph transversal of graphs

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