Pages that link to "Item:Q798333"
From MaRDI portal
The following pages link to Graphs whose neighborhoods have no special cycles (Q798333):
Displaying 15 items.
- Clique complexes and graph powers (Q375885) (← links)
- On weighted efficient total domination (Q414423) (← links)
- Dominating set games. (Q703283) (← links)
- Minimum fractional dominating functions and maximum fractional packing functions (Q1025952) (← links)
- A characterization of totally balanced hypergraphs (Q1066918) (← links)
- Neighborhood perfect graphs (Q1081622) (← links)
- The parallel solution of domination problems on chordal and strongly chordal graphs (Q1331893) (← links)
- Transversal partitioning in balanced hypergraphs (Q1372732) (← links)
- Subgraph trees in graph theory (Q1406544) (← links)
- Incidence graphs of biacyclic hypergraphs (Q1923616) (← links)
- Graphs in which \(G - N[v]\) is a cycle for each vertex \(v\) (Q2037597) (← links)
- Graphs \(G\) in which \(G-N[v]\) has a prescribed property for each vertex \(v\) (Q2146735) (← links)
- Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs (Q2344774) (← links)
- On the complexity of the black-and-white coloring problem on some classes of perfect graphs (Q2445872) (← links)
- Additive sparse spanners for graphs with bounded length of largest induced cycle (Q2576868) (← links)
