Graphs whose neighborhoods have no special cycles
From MaRDI portal
Publication:798333
DOI10.1016/0012-365X(83)90088-2zbMath0546.05047OpenAlexW1990571822MaRDI QIDQ798333
Pierre Duchet, Andries E. Brouwer, Alexander Schrijver
Publication date: 1983
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(83)90088-2
Related Items
Neighborhood perfect graphs, The parallel solution of domination problems on chordal and strongly chordal graphs, Graphs \(G\) in which \(G-N[v\) has a prescribed property for each vertex \(v\)], Transversal partitioning in balanced hypergraphs, Clique complexes and graph powers, Incidence graphs of biacyclic hypergraphs, On weighted efficient total domination, Dually chordal graphs, Subgraph trees in graph theory, On the complexity of the black-and-white coloring problem on some classes of perfect graphs, Dominating set games., Graphs in which \(G - N[v\) is a cycle for each vertex \(v\)], Minimum fractional dominating functions and maximum fractional packing functions, Additive sparse spanners for graphs with bounded length of largest induced cycle, Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs, A characterization of totally balanced hypergraphs
Cites Work
