Pages that link to "Item:Q4209931"
From MaRDI portal
The following pages link to A survey of hereditary properties of graphs (Q4209931):
Displayed 47 items.
- Hamiltonicity and generalised total colourings of planar graphs (Q274671) (← links)
- The quest for a characterization of hom-properties of finite character (Q274710) (← links)
- On the maximum weight of a sparse connected graph of given order and size (Q293629) (← links)
- Acyclic colorings of graphs with bounded degree (Q310229) (← links)
- Universal \(H\)-colourable graphs (Q367065) (← links)
- The property of \(k\)-colourable graphs is uniquely decomposable (Q383763) (← links)
- Problems on cycles and colorings (Q383772) (← links)
- Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphs (Q432716) (← links)
- Some results on decomposable and reducible graph properties (Q442353) (← links)
- Distance domination versus iterated domination (Q442389) (← links)
- Nontraceable detour graphs (Q868352) (← links)
- \([r,s,t]\)-chromatic numbers and hereditary properties of graphs (Q868364) (← links)
- On invariants of hereditary graph properties (Q868369) (← links)
- Generalised game colouring of graphs (Q878606) (← links)
- The path partition conjecture is true for claw-free graphs (Q878616) (← links)
- Some bounds on the generalised total chromatic number of degenerate graphs (Q1675922) (← links)
- \(\mathcal Q\)-Ramsey classes of graphs (Q1761462) (← links)
- Path partitions and \(P_{n}\)-free sets (Q1763347) (← links)
- Minimal vertex Ramsey graphs and minimal forbidden subgraphs (Q1883248) (← links)
- Domination, independence and irredundance with respect to additive induced-hereditary prop\-erties (Q1883262) (← links)
- Minimal reducible bounds for induced-hereditary properties (Q1883266) (← links)
- Acyclic improper colouring of graphs with maximum degree 4 (Q2018890) (← links)
- Graph classes generated by Mycielskians (Q2194538) (← links)
- Generalized hypergraph coloring (Q2214310) (← links)
- Robustness: a new form of heredity motivated by dynamic networks (Q2285145) (← links)
- \((\mathcal{P},\mathcal{Q})\)-total \((r,s)\)-colorings of graphs (Q2346335) (← links)
- Improper choosability of graphs of nonnegative characteristic (Q2389752) (← links)
- \(F\)-WORM colorings: results for 2-connected graphs (Q2403800) (← links)
- Coloring subgraphs with restricted amounts of hues (Q2406596) (← links)
- Generalized sum List colorings of graphs (Q2416953) (← links)
- Cycle partition of two-connected and two-edge connected graphs (Q2516513) (← links)
- Generalized fractional total colorings of graphs (Q2516673) (← links)
- Generalized fractional and circular total colorings of graphs (Q2516678) (← links)
- Chromatic sums for colorings avoiding monochromatic subgraphs (Q2516680) (← links)
- Edge-colouring of graphs and hereditary graph properties (Q2810158) (← links)
- On a tree-partition problem (Q3439601) (← links)
- A note on on-line ranking number of graphs (Q3599891) (← links)
- Partially composed property of generalized lexicographic product graphs (Q4597965) (← links)
- Factorizations and characterizations of induced‐hereditary and compositive properties (Q4680401) (← links)
- Additive and hereditary properties of graphs are uniquely factorizable into irreducible factors (Q4944685) (← links)
- On edge product cordial graphs (Q5106685) (← links)
- Partition of a planar graph with girth 6 into two forests with chain length at most 4 (Q5264731) (← links)
- Unique Factorization Theorem and Formal Concept Analysis (Q5452428) (← links)
- (Q5708569) (← links)
- (Q5708600) (← links)
- Generalized DP-colorings of graphs (Q6091813) (← links)
- Axiomatic characterization of the toll walk function of some graph classes (Q6132559) (← links)