scientific article; zbMATH DE number 1868869

zbMATH Open1007.05066MaRDI QIDQ4794016

Dragan Mašulović

Publication date: 16 February 2003

Full work available at URL: https://eudml.org/doc/225309

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

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

On computing the path number of a graph ⋮ [[Publication:5203033|Title not available (Why is that?)]] ⋮ [[Publication:3698827|Title not available (Why is that?)]]

Recommendations

• On the path separation number of graphs 👍 👎
• Counting paths in digraphs 👍 👎
• On the number of paths and cycles for almost all graphs and digraphs 👍 👎
• On computing the path number of a graph 👍 👎
• Paths and stability number in digraphs 👍 👎
• On the number of reachable pairs in a digraph 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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