The even adjacency split problem for graphs

DOI10.1016/S0166-218X(99)00183-3zbMath0957.68087MaRDI QIDQ1566571

J. B. Stehman, Grant A. Cheston, Arthur L. Liestman, Stephen T. Hedetniemi

Publication date: 27 November 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

even adjacency split problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of partitioning graphs into connected subgraphs
• Sparse broadcast graphs
• On the construction of minimal broadcast networks
• A Linear Tree Partitioning Algorithm
• A data structure for manipulating priority queues
• Implementation and Analysis of Binomial Queue Algorithms
• Tight Bounds on Mimimum Broadcast Networks

This page was built for publication: The even adjacency split problem for graphs