Graphs whose neighborhoods have no special cycles

DOI10.1016/0012-365X(83)90088-2MaRDI QIDQ798333zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

closed neighborhoodsneighborhood-hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65)

Recommendations

• Graphs whose r-neighbourhoods form conformal hypergraphs
• scientific article; zbMATH DE number 3926963
• scientific article; zbMATH DE number 4093511
• Neighborhood perfect graphs
• Structural properties and hamiltonicity of neighborhood graphs

Cites work

• scientific article; zbMATH DE number 3889566 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3505022 (Why is no real title available?)
• scientific article; zbMATH DE number 3641484 (Why is no real title available?)
• Characterizations of strongly chordal graphs
• Perfect Elimination and Chordal Bipartite Graphs
• Properties of (0,1)-matrices with no triangles

Cited in

(23)

• Dominating set games.
• Minimum fractional dominating functions and maximum fractional packing functions
• Graphs \(G\) where \(G-N[v]\) is a regular graph for each vertex \(v\)
• scientific article; zbMATH DE number 150463 (Why is no real title available?)
• A characterization of totally balanced hypergraphs
• On the complexity of the black-and-white coloring problem on some classes of perfect graphs
• 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
• Clique complexes and graph powers
• Graphs \(G\) in which \(G-N[v]\) has a prescribed property for each vertex \(v\)
• 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
• scientific article; zbMATH DE number 1187256 (Why is no real title available?)
• 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)