scientific article; zbMATH DE number 894703

zbMATH Open0852.05067MaRDI QIDQ4882977FDOQ4882977

Authors: Yair Caro 

Publication date: 25 November 1996

Title of this publication is not available (Why is that?)

Recommendations

• A matroid generalization of theorems of Lewin and Gallai
• Parity theorems for paths and cycles in graphs
• Some graphic uses of an even number of odd nodes
• Gallai theorems for graphs, hypergraphs, and set systems
• On induced subgraphs with all degree odd

zbMATH Keywords

partitioncoveringsparity theoremsparity cover

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Paths and cycles (05C38) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (16)

• Odd neighborhood transversals on grid graphs
• A note on Lights-Out-puzzle: parity-state graphs
• Note on Perfect Forests
• Bonds with parity constraints
• Even poset and a parity result for binary linear code
• A counterexample to the lights out problem
• A matroid generalization of theorems of Lewin and Gallai
• Effects of edge addition or removal on the nullity of a graph
• Parity theorems for paths and cycles in graphs
• A Survey of the Game “Lights Out!”
• On induced subgraphs with all degree odd
• Parity Dimension for Graphs - A Linear Algebraic Approach
• On the complexity of dominating set problems related to the minimum all-ones problem
• Generalized switch-setting problems
• Lights Out on graphs
• A simple proof of a theorem of Parish

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4882977)