A note on algebraic expressions of rhomboidal labeled graphs

DOI10.1016/J.ENDM.2015.05.036zbMATH Open1347.05198OpenAlexW820189763MaRDI QIDQ324971FDOQ324971

Mark Korenblit

Publication date: 17 October 2016

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

zbMATH Keywords

decompositionseries-parallel graphexpressionlabeled graphrhomboidtwo-terminal directed acyclic graph

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Introduction to algorithms
• A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks
• A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
• Coloring inductive graphs on-line
• Optimal Reduction of Two-Terminal Directed Acyclic Graphs
• Generalized Fibonacci maximum path graphs
• Scheduling UET-UCT series-parallel graphs on two processors
• Topology of series-parallel networks
• A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids

Cited In (2)

• Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs
• On algebraic expressions of directed grid graphs

This page was built for publication: A note on algebraic expressions of rhomboidal labeled graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324971)