In this paper, we study minimal vertex covers of bipartite planar graphs, introducing a new class of such graphs, denoted as Bn,t. We analyze their structure and provide explicit formulas for their vertex covering number. Our results contribute to a deeper understanding of combinatorial properties in graph theory.
Minimal vertex covers of bipartite planar graphs
M. Imbesi;M. La Barbiera;
In corso di stampa
Abstract
In this paper, we study minimal vertex covers of bipartite planar graphs, introducing a new class of such graphs, denoted as Bn,t. We analyze their structure and provide explicit formulas for their vertex covering number. Our results contribute to a deeper understanding of combinatorial properties in graph theory.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
