scientific article; zbMATH DE number 894703

MaRDI QIDQ4882977zbMATH OpenFDO

Authors Yair Caro

Publication date 25 November 1996

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)

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

Cited in

(17)

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

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)