scientific article; zbMATH DE number 843316
From MaRDI portal
Publication:4862678
Chinese postman problemchromatic numberchromatic polynomialconnectednesscovering numberscycle structurescyclesdegree sequencesdigraphdomination numberEulerian graphsforestsgraphgraph operationsgraph productsHamiltonian graphsindependence numbersirredundance numberKuratowski's theoremline graphsmatchingsMenger's theoremsmin-cut algorithmspathsperfect graphsplanar graphsRamsey numberstotal colouringstoughnesstournamentstreeTuran's theoremTutte's 1-factor theoremVizing's theorem
Cited in
(19)- The connectivity of a graph and its complement
- On unique \(k\)-factors and unique \([1,k]\)-factors in graphs.
- Upper bounds for \(f\)-domination number of graphs
- Characterization of graphs with equal domination and covering number
- A graph library for Isabelle
- Graphs with equal domination and covering numbers
- On \(k\)-domination and \(j\)-independence in graphs
- Equality of domination and transversal numbers in hypergraphs
- Multipartite tournaments: a survey
- Local-edge-connectivity in digraphs and oriented graphs
- scientific article; zbMATH DE number 3841894 (Why is no real title available?)
- Some remarks on the eigenvalue multiplicities of the Laplacian on infinite locally finite trees
- On the order of certain close to regular graphs without a matching of given size
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- scientific article; zbMATH DE number 7196833 (Why is no real title available?)
- From domination to coloring. Stephen Hedetniemi's graph theory and beyond
- A textbook of graph theory
- Smallest close to regular bipartite graphs without an almost perfect matching
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
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 Q4862678)
