A survey of hereditary properties of graphs
From MaRDI portal
Publication:4209931
DOI10.7151/dmgt.1037zbMath0902.05026OpenAlexW2041660094MaRDI QIDQ4209931
Mieczysław Borowiecki, Marietjie Frick, Peter Mihók, Izak Broere, Gabriel Semanisin
Publication date: 2 December 1998
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/c295567aad20b7b120726455e77b56ff699a6f02
Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Structure and representation theory of distributive lattices (06D05) Complexity of computation (including implicit computational complexity) (03D15) Coloring of graphs and hypergraphs (05C15) Structure theory of lattices (06B05)
Related Items
Hamiltonicity and generalised total colourings of planar graphs ⋮ The quest for a characterization of hom-properties of finite character ⋮ Minimal vertex Ramsey graphs and minimal forbidden subgraphs ⋮ Domination, independence and irredundance with respect to additive induced-hereditary prop\-erties ⋮ Minimal reducible bounds for induced-hereditary properties ⋮ On the maximum weight of a sparse connected graph of given order and size ⋮ Acyclic colorings of graphs with bounded degree ⋮ Improper choosability of graphs of nonnegative characteristic ⋮ Nontraceable detour graphs ⋮ \([r,s,t\)-chromatic numbers and hereditary properties of graphs] ⋮ On invariants of hereditary graph properties ⋮ Universal \(H\)-colourable graphs ⋮ \(F\)-WORM colorings: results for 2-connected graphs ⋮ Coloring subgraphs with restricted amounts of hues ⋮ Additive and hereditary properties of graphs are uniquely factorizable into irreducible factors ⋮ Generalised game colouring of graphs ⋮ The path partition conjecture is true for claw-free graphs ⋮ Some bounds on the generalised total chromatic number of degenerate graphs ⋮ The property of \(k\)-colourable graphs is uniquely decomposable ⋮ Problems on cycles and colorings ⋮ Generalized sum List colorings of graphs ⋮ Generalized DP-colorings of graphs ⋮ On edge product cordial graphs ⋮ Graph classes generated by Mycielskians ⋮ Axiomatic characterization of the toll walk function of some graph classes ⋮ Partially composed property of generalized lexicographic product graphs ⋮ Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphs ⋮ Some results on decomposable and reducible graph properties ⋮ Distance domination versus iterated domination ⋮ Generalized hypergraph coloring ⋮ \(\mathcal Q\)-Ramsey classes of graphs ⋮ Path partitions and \(P_{n}\)-free sets ⋮ Acyclic improper colouring of graphs with maximum degree 4 ⋮ Factorizations and characterizations of induced‐hereditary and compositive properties ⋮ A note on on-line ranking number of graphs ⋮ Robustness: a new form of heredity motivated by dynamic networks ⋮ Unique Factorization Theorem and Formal Concept Analysis ⋮ Cycle partition of two-connected and two-edge connected graphs ⋮ Generalized fractional total colorings of graphs ⋮ Generalized fractional and circular total colorings of graphs ⋮ Chromatic sums for colorings avoiding monochromatic subgraphs ⋮ Edge-colouring of graphs and hereditary graph properties ⋮ Unnamed Item ⋮ Unnamed Item ⋮ \((\mathcal{P},\mathcal{Q})\)-total \((r,s)\)-colorings of graphs ⋮ On a tree-partition problem ⋮ Partition of a planar graph with girth 6 into two forests with chain length at most 4
