scientific article; zbMATH DE number 843316

zbMath0844.05001MaRDI QIDQ4862678

Lutz Volkmann

Publication date: 11 February 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

treepathsconnectednessgraphdigraphcyclesplanar graphsEulerian graphstournamentsRamsey numberschromatic numbermatchingsperfect graphschromatic polynomialgraph productstoughnessdomination numbercovering numbersHamiltonian graphsline graphsChinese postman problemforestsgraph operationsdegree sequencesVizing's theoremTuran's theoremKuratowski's theoremirredundance numberTutte's 1-factor theoremcycle structuresindependence numberstotal colouringsMenger's theoremsmin-cut algorithms

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)

Related Items (14)

Some remarks on the eigenvalue multiplicities of the Laplacian on infinite locally finite trees ⋮ Smallest close to regular bipartite graphs without an almost perfect matching ⋮ On \(k\)-domination and \(j\)-independence in graphs ⋮ Equality of domination and transversal numbers in hypergraphs ⋮ On unique \(k\)-factors and unique \([1,k\)-factors in graphs.] ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Multipartite tournaments: a survey ⋮ Local-edge-connectivity in digraphs and oriented graphs ⋮ A graph library for Isabelle ⋮ The connectivity of a graph and its complement ⋮ On the order of certain close to regular graphs without a matching of given size ⋮ Graphs with equal domination and covering numbers ⋮ Upper bounds for \(f\)-domination number of graphs ⋮ Characterization of graphs with equal domination and covering number

This page was built for publication: