Complete forcing numbers of complete and almost-complete multipartite graphs

DOI10.1007/s10878-023-01078-7MaRDI QIDQ6053962

No author found.

Publication date: 27 September 2023

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

perfect matchingcomplete multipartite graphcomplete forcing number

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complete forcing numbers of primitive coronoids
• The global forcing number of the parallelogram polyhex
• On the global forcing number of hexagonal systems
• A min-max theorem for plane bipartite graphs
• Defining sets in vertex colorings of graphs and latin rectangles
• Complete forcing numbers of hexagonal systems
• On the forcing matching numbers of prisms of graphs
• Relations between global forcing number and maximum anti-forcing number of a graph
• Complete forcing numbers of hexagonal systems. II
• Complete forcing numbers of catacondensed hexagonal systems
• Global forcing number of benzenoid graphs
• Characterizing the fullerene graphs with the minimum forcing number 3
• On the minimum number of blocks defining a design
• Complete Forcing Numbers of Polyphenyl Systems
• Birkhoff--von Neumann Graphs that are PM-Compact
• Complete forcing numbers of graphs

This page was built for publication: Complete forcing numbers of complete and almost-complete multipartite graphs