My Top 10 Graph Theory Conjectures and Open Problems
From MaRDI portal
Publication:5506779
DOI10.1007/978-3-319-31940-7_8zbMath1352.05049OpenAlexW2532259897MaRDI QIDQ5506779
Publication date: 16 December 2016
Published in: Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-31940-7_8
Trees (05C05) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07) Graph operations (line graphs, products, etc.) (05C76)
Related Items
Cites Work
- A note on \(\gamma\)-graphs
- The path partition conjecture is true for claw-free graphs
- Queen's domination using border squares and \((A,B)\)-restricted domination
- Minimum dominating set of queens: a trivial programming exercise?
- The chromatic number of the product of two 4-chromatic graphs is 4
- Packing trees in complete graphs
- Some perfect coloring properties of graphs
- Inverse domination in graphs
- A survey on Hedetniemi's conjecture
- Iterated colorings of graphs.
- Achromatic number versus pseudoachromatic number: A counterexample to a conjecture of Hedetniemi
- Nearly perfect sets in graphs
- A survey of the Path Partition Conjecture
- γ-graphs of graphs
- Vizing's conjecture: a survey and recent results
- The Domination Number of Grids
- Packing a tree with a graph of the same size
- Total domination in graphs
- Complexity of ideals in finite semigroups and finite-state machines
- Hedetniemi's conjecture---a survey
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
