Dominating Bipartite Subgraphs in Graphs | Zendy

Gábor Bacsó | Zendy; Danuta Michalak | Zendy; Zsolt Tuza | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Dominating Bipartite Subgraphs in Graphs

Author(s) -

Gábor Bacsó,

Danuta Michalak,

Zsolt Tuza

Publication year - 2005

Publication title -

discussiones mathematicae graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.476

H-Index - 19

eISSN - 2083-5892

pISSN - 1234-3099

DOI - 10.7151/dmgt.1263

Subject(s) - combinatorics , mathematics , bipartite graph , cograph , induced subgraph , complete bipartite graph , discrete mathematics , maximal independent set , induced subgraph isomorphism problem , chordal graph , indifference graph , distance hereditary graph , graph , 1 planar graph , line graph , voltage graph , vertex (graph theory)

A graph G is hereditarily dominated by a class D of connected graphs if each connected induced subgraph of G contains a dominating induced subgraph belonging to D. In this paper we characterize graphs hereditarily dominated by classes of complete bipartite graphs, stars, connected bipartite graphs, and complete k-partite graphs.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research