On extremal weighted digraphs with no heavy paths

DOI10.1016/j.disc.2010.01.016zbMath1225.05116arXiv1111.5756OpenAlexW2092091178MaRDI QIDQ968444

Sheng Gui Zhang, Bin Long Li

Publication date: 5 May 2010

Published in: Discrete Mathematics, Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.5756

zbMATH Keywords

extremal graphsweighted graphweighted digraphsheavy pathsheavy pathweighed degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07) Signed and weighted graphs (05C22)

Related Items (1)

On vertex-induced weighted Turán problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New sufficient conditions for cycles in graphs
• Weighted degrees and heavy cycles in weighted graphs
• A fan type condition for heavy cycles in weighted graphs
• A proof of a conjecture of Bondy concerning paths in weighted digraphs
• Ore-type degree condition for heavy paths in weighted graphs
• Heavy cycles in weighted graphs
• Some Theorems on Abstract Graphs

This page was built for publication: On extremal weighted digraphs with no heavy paths