scientific article; zbMATH DE number 6469239

MaRDI QIDQ5501358zbMATH OpenFDO

Authors Lap Chi Lau

Publication date 3 August 2015

Mathematics Subject Classification ID

Distance in graphs (05C12) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Bipartite roots of graphs
• Bipartite Graphs and their Degree Sets
• Bipartite bithreshold graphs
• A note on the permanental roots of bipartite graphs
• scientific article; zbMATH DE number 4061296
• Bipartable graphs
• Bipartization of graphs
• scientific article; zbMATH DE number 19220
• scientific article; zbMATH DE number 5296402
• scientific article; zbMATH DE number 1194938

Cited in

(8)

• Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
• Complexity of finding graph roots with girth conditions
• Bipartite roots of graphs
• A unified approach to recognize squares of split graphs
• Constrained representations of map graphs and half-squares
• scientific article; zbMATH DE number 7324127 (Why is no real title available?)
• Characterizing and recognizing exact-distance squares of graphs
• A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph

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