Graphs whose neighborhoods have no special cycles
From MaRDI portal
Publication:798333
DOI10.1016/0012-365X(83)90088-2zbMATH Open0546.05047OpenAlexW1990571822MaRDI QIDQ798333FDOQ798333
Authors: 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
Recommendations
Cites Work
Cited In (23)
- Dominating set games.
- Graphs \(G\) where \(G-N[v]\) is a regular graph for each vertex \(v\)
- Minimum fractional dominating functions and maximum fractional packing functions
- Title not available (Why is that?)
- On the complexity of the black-and-white coloring problem on some classes of perfect graphs
- A characterization of totally balanced hypergraphs
- Subgraph trees in graph theory
- On weighted efficient total domination
- Regular graphs with no homomorphisms onto cycles
- Graphs \(G\) where \(G-N[v]\) is a tree for each vertex \(v\)
- Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs
- Incidence graphs of biacyclic hypergraphs
- Graphs \(G\) in which \(G-N[v]\) has a prescribed property for each vertex \(v\)
- Clique complexes and graph powers
- Graphs in which \(G - N[v]\) is a cycle for each vertex \(v\)
- Dually chordal graphs
- On a property of neighborhood hypergraphs.
- The parallel solution of domination problems on chordal and strongly chordal graphs
- Title not available (Why is that?)
- Graphs whose r-neighbourhoods form conformal hypergraphs
- Additive sparse spanners for graphs with bounded length of largest induced cycle
- Transversal partitioning in balanced hypergraphs
- Neighborhood perfect graphs
This page was built for publication: Graphs whose neighborhoods have no special cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798333)
