The following pages link to (Q4947393):
Displaying 50 items.
- An approach to the performance of SPC product codes on the erasure channel (Q259259) (← links)
- Counting the number of non-equivalent vertex colorings of a graph (Q260025) (← links)
- The deficiency of all generalized Hertz graphs and minimal consecutively non-colourable graphs in this class (Q279204) (← links)
- Maximum weighted induced subgraphs (Q279221) (← links)
- A structure theory for graphs with fixed smallest eigenvalue (Q286130) (← links)
- Cycle covers. II: Circuit chain, Petersen chain and Hamilton weights. (Q290803) (← links)
- Excluded-minor characterization of apex-outerplanar graphs (Q292261) (← links)
- Separation dimension of graphs and hypergraphs (Q300474) (← links)
- Distributed adaptive neural control of nonlinear multi-agent systems with unknown control directions (Q335738) (← links)
- A survey on modeling of microgrids -- From fundamental physics to phasors and voltage sources (Q340651) (← links)
- Complete intersection toric ideals of oriented graphs and chorded-theta subgraphs (Q372841) (← links)
- On Ramsey (\(K_{1,m},\mathcal{G}\))-minimal graphs (Q383736) (← links)
- Combinatorial characterizations of the Cohen-Macaulayness of the second power of edge ideals (Q385038) (← links)
- On a conjecture on the balanced decomposition number (Q389207) (← links)
- Critical sets for Sudoku and general graph colorings (Q393178) (← links)
- Maximum induced forests in graphs of bounded treewidth (Q396918) (← links)
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths (Q402591) (← links)
- Graph factors modulo \(k\) (Q402597) (← links)
- Note on the subgraph component polynomial (Q406698) (← links)
- Boxicity of line graphs (Q409342) (← links)
- Forbidden induced subgraphs for star-free graphs (Q409360) (← links)
- Some fixed point results on a metric space with a graph (Q409496) (← links)
- Effective feature construction by maximum common subgraph sampling (Q413859) (← links)
- A semigroup proof of the bounded degree case of S.B. Rao's conjecture on degree sequences and a bipartite analogue (Q414650) (← links)
- Computing inertia sets using atoms (Q417545) (← links)
- The competition number of a graph and the dimension of its hole space (Q427694) (← links)
- Tension continuous maps -- their structure and applications (Q427807) (← links)
- A branch-and-price approach for harvest scheduling subject to maximum area restrictions (Q434163) (← links)
- A characterization of partial blocks in weighted graphs (Q456097) (← links)
- Lower bounds on kernelization (Q456702) (← links)
- When the unit, unitary and total graphs are ring graphs and outerplanar (Q457930) (← links)
- Security concepts for the dynamics of autonomous vehicle networks (Q462363) (← links)
- Spanning closed walks and TSP in 3-connected planar graphs (Q462924) (← links)
- On large semi-linked graphs (Q468447) (← links)
- A note on vertex colorings of plane graphs (Q472144) (← links)
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490) (← links)
- Edge-signed graphs with smallest eigenvalue greater than \(-2\) (Q473101) (← links)
- Communication in repeated network games with imperfect monitoring (Q485763) (← links)
- Generating and counting unlabeled \(k\)-path graphs (Q496683) (← links)
- Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs (Q497365) (← links)
- Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\) (Q500982) (← links)
- Independent sets in graphs (Q501998) (← links)
- Network characterizations for excluding Braess's paradox (Q506543) (← links)
- An advance in infinite graph models for the analysis of transportation networks (Q511389) (← links)
- Cops and robbers ordinals of cop-win trees (Q512565) (← links)
- Synthesis of deterministic top-down tree transducers from automatic tree relations (Q515670) (← links)
- On graphs uniquely defined by their \(K\)-circular matroids (Q516878) (← links)
- Forbidden structures for planar perfect consecutively colourable graphs (Q521749) (← links)
- Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
- \(k\)-circular matroids of graphs (Q528553) (← links)
