scientific article; zbMATH DE number 894703

MaRDI QIDQ4882977zbMATH OpenFDO

Authors Yair Caro

Publication date 25 November 1996

zbMATH Keywords

coveringsparity coverparity theoremspartition

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

(18)

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

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)