On the bipartite vertex frustration of graphs

DOI10.1016/j.endm.2016.09.050zbMath1356.05027OpenAlexW2536104944MaRDI QIDQ510603

Yong-Cai Geng, Sumit K. Garg

Publication date: 13 February 2017

Full work available at URL: https://doi.org/10.1016/j.endm.2016.09.050

zbMATH Keywords

treeHamiltonian graphline graphbipartite edge frustrationbipartite vertex frustration

Mathematics Subject Classification ID

Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

On the computational complexity of the bipartizing matching problem

Cites Work

• Unnamed Item
• Unnamed Item
• The bipartite edge frustration of composite graphs
• The bipartite edge frustration of graphs under subdivided edges and their related sums
• Extremal properties of the bipartite vertex frustration of graphs
• The bipartite edge frustration of extension of splice and link graphs
• Computing the bipartite edge frustration of fullerene graphs
• Wiener index of iterated line graphs of trees homeomorphic to the claw K_1,3

This page was built for publication: On the bipartite vertex frustration of graphs