On resistance of graphs

DOI10.1016/j.dam.2010.11.001zbMath1228.05159OpenAlexW2025408754MaRDI QIDQ643030

H. E. Sargsyan, Petros A. Petrosyan

Publication date: 27 October 2011

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

Full work available at URL: https://doi.org/10.1016/j.dam.2010.11.001

zbMATH Keywords

edge-coloringregular graphresistanceinterval coloringdeficiency

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

Further results on the deficiency of graphs, Measures of edge-uncolorability of cubic graphs

Cites Work

• Compact scheduling of zero-one time operations in multi-stage systems
• Lower bounds and a tabu search algorithm for the minimum deficiency problem
• On the deficiency of bipartite graphs
• Investigation on interval edge-colorings of graphs
• Classification and characterizations of snarks
• Measurements of edge-uncolorability
• The deficiency of a regular graph
• Interval coloring of (3,4)-biregular bipartite graphs having large cubic subgraphs
• Proper path‐factors and interval edge‐coloring of (3,4)‐biregular bigraphs
• Interval colorings of edges of a multigraph
• Consecutive colorings of the edges of general graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item