Properties of algebraically defined edge-colored graphs
From MaRDI portal
Cites work
- Classification by girth of three-dimensional algebraically defined monomial graphs over the real numbers
- Color degree and alternating cycles in edge-colored graphs
- Cycles and paths in edge‐colored graphs with given degrees
- Isomorphism criterion for monomial graphs
- Monomial graphs and generalized quadrangles
- Nonisomorphic two-dimensional algebraically defined graphs over \(\mathbb{R}\)
- On an estimate of the chromatic class of a \(p\)-graph
- On monomial graphs of girth eight
- On proper-path colorings in graphs
- On the characterization of some algebraically defined bipartite graphs of girth eight
- On the girth of three-dimensional algebraically defined graphs with multiplicatively separable functions
- On the girth of two-dimensional real algebraically defined graphs
- On the uniqueness of some girth eight algebraically defined graphs
- On the uniqueness of some girth eight algebraically defined graphs. II
- Orthomorphisms and the construction of projective planes
- Proof of a conjecture on monomial graphs
- Proper connection of graphs
- Properly colored connectivity of graphs
- Properly colored paths and cycles
- The proper diameter of a graph
This page was built for publication: Properties of algebraically defined edge-colored graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7268494)