scientific article; zbMATH DE number 3404271

zbMATH Open0256.05115MaRDI QIDQ5670652FDOQ5670652

Authors: Allen J. Schwenk, Frank Harary 

Publication date: 1972

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Cited In (12)

• Title not available (Why is that?)
• Decomposing graphs into internally-disjoint induced paths
• Graph theory (algorithmic, algebraic, and metric problems)
• Decomposition of graphs into paths and cycles
• NP-completeness of some problems of partitioning and covering in graphs
• Induced graphoidal decompositions in product graphs
• Induced label graphoidal graphs
• Tree cover number and maximum semidefinite nullity of some graph classes
• Difference Labeling and Decomposition
• Three ways to cover a graph
• An algorithm to cyclic path covering number
• Path covering problems and testing of printed circuits

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 Q5670652)